Noam Nisan constructed pseudo random number generators which convert O(S log R) truly random bits to R bits that appear random to any algorithm that runs in SPACE(S). D Sivakumar, demonstrated that a large class of probabilistic algorithms can be derandomized using Nisan’s construction. This class of algorithms is characterized by the fact that each probabilistic algorithm can thought of as a s...

Two probabilistic approaches to cross-lingual retrieval are in wide use today, those based on probabilistic models of relevance, as exemplified by INQUERY, and those based on language modeling. INQUERY, as a query net model, allows the easy incorporation of query operators, including a synonym operator, which has proven to be extremely useful in cross-language information retrieval (CLIR), in a...

We describe the design, semantics, and implementation of a probabilistic programming language where programs are spreadsheet queries. Given an input database consisting of tables held in a spreadsheet, a query constructs a probabilistic model conditioned by the spreadsheet data, and returns an output database determined by inference. This work extends probabilistic programming systems in three ...

Figure 4.1: Improving VLSI testability using (a) demultiplexers; (b) multi-Abstract Asynchronous VLSI designs are becoming an intensive area of research due to their advantages in comparison with synchronous circuits, such as the absence of the clock distribution problem, lower power consumption and higher performance. The work described in this thesis is an attempt to find possible ways to tes...

In probabilistic grammatical inference, a usual goal is to infer a good approximation of an unknown distribution P called a stochastic language. The estimate of P stands in some class of probabilistic models such as probabilistic automata (PA). In this paper, we focus on probabilistic models based on multiplicity automata (MA). The stochastic languages generated by MA are called rational stocha...

Abstract Behavioural distances measure the deviation between states in quantitative systems, such as probabilistic or weighted systems. There is growing interest generic approaches to behavioural distances. In particular, coalgebraic methods capture variations system type (nondeterministic, probabilistic, game-based etc.), and notion of quantale abstracts over actual values take, thus covering,...

Why are probabilistic roadmap (PRM) planners “probabilistic”? This paper tries to establish the probabilistic foundations of PRM planning and reexamines previous work in this context. It shows that the success of PRM planning depends mainly and critically on the assumption that the configuration space C of a robot often verifies favorable “visibility” properties that are not directly dependent ...

the aim of this paper is to generalize the‎‎notion of pseudo-almost valuation domains to arbitrary‎ ‎commutative rings‎. ‎it is shown that the classes of chained rings‎ ‎and pseudo-valuation rings are properly contained in the class of‎ ‎pseudo-almost valuation rings; also the class of pseudo-almost‎ ‎valuation rings is properly contained in the class of quasi-local‎ ‎rings with linearly ordere...

Probabilistic model checking is an emerging technology for analyzing systems which exhibit stochastic behaviors. The verification of a larger system using probabilistic model checking faces the same state explosion problem as ordinary model checking. Probabilistic symmetry reduction is a technique to tackle this problem. In this paper, we study probabilistic symmetry reduction for a system with...