325 search results - page 3 / 65 » Alternatives to two classic data structures |
WADS
1997
Springer
15 years 1 months ago
1997
Springer
We present several efficient dynamic data structures for point-enclosure queries, involving convex fat objects in R2 or R3. Our planar structures are actually fitted for a more ...
SAC
2008
ACM
14 years 9 months ago
2008
ACM
We consider analysis of complex stochastic models based upon partial information. MCMC and reversible jump MCMC are often the methods of choice for such problems, but in some situ...
FOCS
2007
IEEE
15 years 3 months ago
2007
IEEE
Attempts to find new quantum algorithms that outperform classical computation have focused primarily on the nonabelian hidden subgroup problem, which generalizes the central prob...
ILP
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. We study predicate selection functions (also known as splitting rules) for structural decision trees and propose two improvements to existing schemes. The first is in cl...
WDAG
2004
Springer
15 years 2 months ago
2004
Springer
We apply the classic theory of linearizability to operations that must wait for some other thread to establish a precondition. We model such an operation as a request and a follow-...