Sciweavers

6110 search results - page 360 / 1222
» Approximate Computing
Sort
View
VISUALIZATION
2002
IEEE
15 years 11 months ago
Efficient Simplification of Point-Sampled Surfaces
In this paper we introduce, analyze and quantitatively compare a number of surface simplification methods for point-sampled geometry. We have implemented incremental and hierarchi...
Mark Pauly, Markus H. Gross, Leif Kobbelt
ICDT
2001
ACM
153views Database» more  ICDT 2001»
15 years 11 months ago
Estimating Range Queries Using Aggregate Data with Integrity Constraints: A Probabilistic Approach
In fast OLAP applications it is often advantageous to provide approximate answers to range queries in order to achieve very high performances. A possible solution is to inquire sum...
Francesco Buccafurri, Filippo Furfaro, Domenico Sa...
STOC
1998
ACM
89views Algorithms» more  STOC 1998»
15 years 11 months ago
Minimizing Stall Time in Single and Parallel Disk Systems
We study integrated prefetching and caching problems following the work of Cao et. al. [3] and Kimbrel and Karlin [13]. Cao et. al. and Kimbrel and Karlin gave approximation algor...
Susanne Albers, Naveen Garg, Stefano Leonardi
CCCG
1997
15 years 8 months ago
Label placement by maximum independent set in rectangles
Motivated by the problem of labeling maps, we investigate the problem of computing a large non-intersecting subset in a set of n rectangles in the plane. Our results are as follow...
Pankaj K. Agarwal, Marc J. van Kreveld, Subhash Su...
GECCO
2008
Springer
170views Optimization» more  GECCO 2008»
15 years 7 months ago
Evolving prediction weights using evolution strategy
The evolution strategy is one of the strongest evolutionary algorithms for optimizing real-value vectors. In this paper, we study how to use it for the evolution of prediction wei...
Trung Hau Tran, Cédric Sanza, Yves Duthen