3341 search results - page 178 / 669 » On Bounded Queries and Approximation |
114
click to vote
DLT
2007
15 years 6 months ago
2007
Abstract. Inapproximability results concerning minimization of nondeterministic finite automata relative to given deterministic finite automata were obtained only recently, modul...
136
click to vote
ENDM
2010
15 years 2 months ago
2010
Many inequalities for Mixed-Integer Linear Programs (MILPs) or pure Integer Linear Programs (ILPs) are derived from the Gomory corner relaxation, where all the nonbinding constrai...
171
Voted
COLT
2010
Springer
15 years 2 months ago
2010
Springer
We present a new online learning algorithm in the selective sampling framework, where labels must be actively queried before they are revealed. We prove bounds on the regret of ou...
143
click to vote
ICCSA
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. We consider geometric shortest path queries between arbitrary pairs of objects on a connected polyhedral surface P of genus g. The query objects are points, vertices, edg...
113
click to vote
SIGMOD
1994
ACM
15 years 8 months ago
1994
ACM
In this paper, we propose a novel approach for estimating the record selectivities of database queries. The real attribute value distribution is adaptively approximated by a curve...