496 search results - page 71 / 100 » Machine models and lower bounds for query processing |
CSR
2006
Springer
13 years 11 months ago
2006
Springer
We propose a new model of restricted branching programs specific to solving GEN problems, which we call incremental branching programs. We show that syntactic incremental branchin...
ICML
2008
IEEE
14 years 8 months ago
2008
IEEE
Partially Observable Markov Decision Processes (POMDPs) have succeeded in planning domains that require balancing actions that increase an agent's knowledge and actions that ...
ICC
1997
IEEE
13 years 12 months ago
1997
IEEE
Real measurements in high-speed communications networks have recently shown that traffic may demonstrate properties of long-range dependency peculiar to self-similar stochastic pr...
SPAA
2009
ACM
14 years 8 months ago
2009
ACM
Informative labeling schemes consist in labeling the nodes of graphs so that queries regarding any two nodes (e.g., are the two nodes adjacent?) can be answered by inspecting mere...
ICALP
2004
Springer
14 years 1 months ago
2004
Springer
We define a natural notion of efficiency for approximate nearest-neighbor (ANN) search in general n-point metric spaces, namely the existence of a randomized algorithm which answ...