3055 search results - page 120 / 611 » Randomized Search Trees |
175
click to vote
ADAEUROPE
2003
Springer
15 years 11 months ago
2003
Springer
ontainer. In particular, an iterator abstracts away differences in specific container types, allowing you to view the collection simply as a sequence of items. A generic algorith...
178
click to vote
COMPGEOM
1993
ACM
15 years 10 months ago
1993
ACM
For a polygon P, the bounded Voronoi diagram of P is a partition of P into regions assigned to the vertices of P. A point p inside P belongs to the region of a vertex v if and onl...
169
click to vote
IPPS
2007
IEEE
16 years 18 days ago
2007
IEEE
Until now, structured and unstructured networks have been considered in absentia of each other. We believe that next-generation P2P services will require both structured and unstr...
155
click to vote
CORR
2011
Springer
14 years 10 months ago
2011
Springer
Let Φ be a uniformly distributed random k-SAT formula with n variables and m clauses. We prove that the Walksat algorithm from [16, 17] finds a satisfying assignment of Φ in pol...
131
click to vote
AML
2010
15 years 6 months ago
2010
We give some restrictions for the search for a model of the club principle with no Souslin trees. We show that (2, [], is almost constant on) together with CH and "all Aronsza...