2168 search results - page 133 / 434 » Randomized Algorithms and Complexity Theory |
119
click to vote
COMPGEOM
2005
ACM
15 years 5 months ago
2005
ACM
We initiate the study of exact geometric algorithms that require limited storage and make only a small number of passes over the input. Fundamental problems such as lowdimensional...
136
click to vote
MST
2010
14 years 10 months ago
2010
The 1-versus-2 queries problem, which has been extensively studied in computational complexity theory, asks in its generality whether every efficient algorithm that makes at most 2...
133
click to vote
CONCUR
2003
Springer
15 years 8 months ago
2003
Springer
Abstract. We apply the theory of asynchronous automata to the synthesis problem of closed distributed systems. We use safe asynchronous automata as implementation model, and charac...
151
click to vote
CPAIOR
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. We propose two algorithms achieving generalized arc consistency for the soft global cardinality constraint with variable-based violation and with value-based violation. T...
116
Voted
JMLR
2010
14 years 10 months ago
2010
As we devise more complicated prior distributions, will inference algorithms keep up? We highlight a negative result in computable probability theory by Ackerman, Freer, and Roy (...