Sciweavers

3341 search results - page 281 / 669
» On Bounded Queries and Approximation
Sort
View
APPROX
2006
Springer
105views Algorithms» more  APPROX 2006»
15 years 10 months ago
Space Complexity vs. Query Complexity
Abstract. Combinatorial property testing deals with the following relaxation of decision problems: Given a fixed property and an input x, one wants to decide whether x satisfies th...
Oded Lachish, Ilan Newman, Asaf Shapira
WADS
2007
Springer
128views Algorithms» more  WADS 2007»
16 years 24 days ago
Approximate Range Searching: The Absolute Model
Range searching is a well known problem in the area of geometric data structures. We consider this problem in the context of approximation, where an approximation parameter ε >...
Guilherme Dias da Fonseca
GMP
2006
IEEE
155views Solid Modeling» more  GMP 2006»
16 years 23 days ago
Geometric Accuracy Analysis for Discrete Surface Approximation
In geometric modeling and processing, computer graphics and computer vision, smooth surfaces are approximated by discrete triangular meshes reconstructed from sample points on the...
Junfei Dai, Wei Luo, Shing-Tung Yau, Xianfeng Gu
OA
1989
237views Algorithms» more  OA 1989»
15 years 10 months ago
Which Triangulations Approximate the Complete Graph?
nce Abstract) 1 GAUTAM DAS - University of Wisconsin DEBORAH JOSEPH - University of Wisconsin Chew and Dobkin et. al. have shown that the Delaunay triangulation and its variants ar...
Gautam Das, Deborah Joseph
ICDE
2009
IEEE
170views Database» more  ICDE 2009»
16 years 8 months ago
Semantics of Ranking Queries for Probabilistic Data and Expected Ranks
Abstract-- When dealing with massive quantities of data, topk queries are a powerful technique for returning only the k most relevant tuples for inspection, based on a scoring func...
Graham Cormode, Feifei Li, Ke Yi