1603 search results - page 213 / 321 » Universal Confidence Sets for Solutions of Optimization Prob... |
176
click to vote
COMPGEOM
2009
ACM
16 years 29 days ago
2009
ACM
We consider the following combinatorial problem: given a set of n objects (for example, disks in the plane, triangles), and an integer L ≥ 1, what is the size of the smallest su...
150
click to vote
FOCS
2005
IEEE
16 years 2 days ago
2005
IEEE
We use techniques from sample-complexity in machine learning to reduce problems of incentive-compatible mechanism design to standard algorithmic questions, for a wide variety of r...
166
click to vote
SSD
2005
Springer
15 years 12 months ago
2005
Springer
Abstract. Query optimization is an important functionality of modern database systems and often based on estimating the selectivity of queries before actually executing them. Well-...
144
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Consider a family of sets and a single set, called the query set. How can one quickly find a member of the family which has a maximal intersection with the query set? Time constra...
215
click to vote
ATAL
2007
Springer
15 years 10 months ago
2007
Springer
Multi-Agent Agreement problems (MAP) - the ability of a population of agents to search out and converge on a common state - are central issues in many multi-agent settings, from d...