3341 search results - page 167 / 669 » On Bounded Queries and Approximation |
STOC
2002
ACM
15 years 10 months ago
2002
ACM
The collision problem is to decide whether a function X : {1, . . . , n} {1, . . . , n} is one-to-one or two-to-one, given that one of these is the case. We show a lower bound of...
82
Voted
COLT
1998
Springer
15 years 2 months ago
1998
Springer
Most of the work which attempts to give bounds on the generalization error of the hypothesis generated by a learning algorithm is based on methods from the theory of uniform conve...
159
Voted
SIGMOD
2006
ACM
15 years 10 months ago
2006
ACM
This paper presents a principled framework for efficient processing of ad-hoc top-k (ranking) aggregate queries, which provide the k groups with the highest aggregates as results....
STOC
2004
ACM
15 years 10 months ago
2004
ACM
A flow is said to be confluent if at any node all the flow leaves along a single edge. Given a directed graph G with k sinks and non-negative demands on all the nodes of G, we con...
68
Voted
WINE
2009
Springer
15 years 4 months ago
2009
Springer
In one dimensional facility games, public facilities are placed based on the reported locations of the agents, where all the locations of agents and facilities are on a real line. ...