126 search results - page 11 / 26 » Lower Bounds for Set Intersection Queries |
118
click to vote
PODS
1995
ACM
15 years 1 months ago
1995
ACM
During the last decade various spatial data structures have been designed and compared against each other with respect to their performance. Still missing is a lower bound result,...
CORR
1998
Springer
14 years 9 months ago
1998
Springer
Abstract. Consider a system F of n polynomial equations in n unknowns, over an algebraically closed field of arbitrary characteristic. We present a fast method to find a point in...
IANDC
2006
14 years 9 months ago
2006
This paper studies the complexity of learning classes of expressions in propositional logic from equivalence queries and membership queries. In particular, we focus on bounding th...
SODA
2010
ACM
15 years 7 months ago
2010
ACM
The online learning problem requires a player to iteratively choose an action in an unknown and changing environment. In the standard setting of this problem, the player has to ch...
ICALP
2004
Springer
15 years 3 months ago
2004
Springer
We consider the problem of learning a labeled graph from a given family of graphs on n vertices in a model where the only allowed operation is to query whether a set of vertices i...