1093 search results - page 147 / 219 » Crossover in Probability Spaces |
104
Voted
COMPGEOM
2010
ACM
15 years 5 months ago
2010
ACM
We revisit one of the most fundamental classes of data structure problems in computational geometry: range searching. Back in SoCG’92, Matouˇsek gave a partition tree method fo...
112
Voted
FOCS
1991
IEEE
15 years 4 months ago
1991
IEEE
We wish to increase the power of an arbitrary algorithm designed for non-degenerate input, by allowing it to execute on all inputs. We concentrate on in nitesimal symbolic perturba...
111
click to vote
ECCC
2010
14 years 11 months ago
2010
Applications based on outsourcing computation require guarantees to the data owner that the desired computation has been performed correctly by the service provider. Methods based...
118
click to vote
CORR
2011
Springer
14 years 4 months ago
2011
Springer
We study probabilistic bit-probe schemes for the membership problem. Given a set A of at most n elements from the universe of size m we organize such a structure that queries of t...
98
Voted
ICML
1995
IEEE
16 years 1 months ago
1995
IEEE
In the single rent-to-buy decision problem, without a priori knowledge of the amount of time a resource will be used we need to decide when to buy the resource, given that we can ...