Sciweavers

3341 search results - page 32 / 669
» On Bounded Queries and Approximation
Sort
View
ICALP
2009
Springer
14 years 8 months ago
Bounds on the Size of Small Depth Circuits for Approximating Majority
In this paper, we show that for every constant 0 < < 1/2 and for every constant d 2, the minimum size of a depth d Boolean circuit that -approximates Majority function on n ...
Kazuyuki Amano
EDBT
2009
ACM
160views Database» more  EDBT 2009»
14 years 1 months ago
Estimating aggregates in time-constrained approximate queries in Oracle
The concept of time-constrained SQL queries was introduced to address the problem of long-running SQL queries. A key approach adopted for supporting time-constrained SQL queries i...
Ying Hu, Seema Sundara, Jagannathan Srinivasan
WADS
2005
Springer
95views Algorithms» more  WADS 2005»
14 years 2 months ago
Improved Approximation Bounds for Planar Point Pattern Matching
We analyze the performance of simple algorithms for matching two planar point sets under rigid transformations so as to minimize the directed Hausdorff distance between the sets....
Minkyoung Cho, David M. Mount
EDBT
2002
ACM
129views Database» more  EDBT 2002»
14 years 8 months ago
Schema-Driven Evaluation of Approximate Tree-Pattern Queries
Abstract. We present a simple query language for XML, which supports hierarchical, Boolean-connected query patterns. The interpretation of a query is founded on cost-based query tr...
Torsten Schlieder
PPSN
2010
Springer
13 years 7 months ago
Tight Bounds for the Approximation Ratio of the Hypervolume Indicator
The hypervolume indicator is widely used to guide the search and to evaluate the performance of evolutionary multi-objective optimization algorithms. It measures the volume of the ...
Karl Bringmann, Tobias Friedrich