740 search results - page 28 / 148 » Lower bounds for Buchsbaum* complexes |
170
click to vote
SPAA
2006
ACM
15 years 12 months ago
2006
ACM
One of the fundamental trade-offs in compact routing schemes is between the space used to store the routing table on each node and the stretch factor of the routing scheme – th...
179
click to vote
COLT
2006
Springer
15 years 9 months ago
2006
Springer
We describe a new approach for understanding the difficulty of designing efficient learning algorithms. We prove that the existence of an efficient learning algorithm for a circui...
254
click to vote
PODS
2009
ACM
16 years 6 months ago
2009
ACM
The B-tree is a fundamental external index structure that is widely used for answering one-dimensional range reporting queries. Given a set of N keys, a range query can be answere...
208
click to vote
COMPGEOM
2010
ACM
15 years 11 months ago
2010
ACM
Orthogonal range reporting is the problem of storing a set of n points in d-dimensional space, such that the k points in an axis-orthogonal query box can be reported efficiently. ...
159
click to vote
ICALP
2001
Springer
15 years 10 months ago
2001
Springer
We consider the quantum complexities of the following three problems: searching an ordered list, sorting an un-ordered list, and deciding whether the numbers in a list are all dis...