1778 search results - page 147 / 356 » The Theory of Probabilistic Databases |
148
click to vote
DM
2008
15 years 6 months ago
2008
Extremal Combinatorics is one of the central areas in Discrete Mathematics. It deals with problems that are often motivated by questions arising in other areas, including Theoreti...
168
click to vote
JACM
2002
15 years 6 months ago
2002
An exponential lower bound on the circuit complexity of deciding the weak monadic second-order theory of one successor (WS1S) is proved. Circuits are built from binary operations, ...
203
click to vote
FOSSACS
2011
Springer
14 years 9 months ago
2011
Springer
We give a general framework connecing a branching time relation on nodes of a transition system to a final coalgebra for a suitable endofunctor. Examples of relations treated by o...
216
click to vote
ICLA
2011
Springer
14 years 9 months ago
2011
Springer
We propose a probabilistic interpretation of Propositional Dynamic Logic (PDL). We show that logical and behavioral equivalence are equivalent over general measurable spaces. This...
301
click to vote
ICDE
2009
IEEE
16 years 8 months ago
2009
IEEE
Abstract-- In sensor environments and moving robot applications, the position of an object is often known imprecisely because of measurement error and/or movement of the object. In...