Sciweavers

201 search results - page 18 / 41
» Incremental Algorithms for Approximate Compilation
Sort
View
ALGORITHMICA
2008
79views more  ALGORITHMICA 2008»
14 years 9 months ago
Practical Methods for Shape Fitting and Kinetic Data Structures using Coresets
The notion of -kernel was introduced by Agarwal et al. [5] to set up a unified framework for computing various extent measures of a point set P approximately. Roughly speaking, a ...
Hai Yu, Pankaj K. Agarwal, Raghunath Poreddy, Kast...
CVPR
2010
IEEE
15 years 5 months ago
SPEC Hashing: Similarity Preserving algorithm for Entropy-based Coding
Searching approximate nearest neighbors in large scale high dimensional data set has been a challenging problem. This paper presents a novel and fast algorithm for learning binary...
Ruei-Sung Lin, David Ross, Jay Yagnik
LOPSTR
2005
Springer
15 years 3 months ago
An Algorithm for Local Variable Elimination in Normal Logic Programs
A variable is local if it occurs in a clause body but not in its head. Local variables appear naturally in practical logic programming, but they complicate several aspects such as ...
Javier Álvez, Paqui Lucio
111
Voted
ARITH
2009
IEEE
15 years 1 months ago
A New Binary Floating-Point Division Algorithm and Its Software Implementation on the ST231 Processor
This paper deals with the design and implementation of low latency software for binary floating-point division with correct rounding to nearest. The approach we present here targe...
Claude-Pierre Jeannerod, Herve Knochel, Christophe...
84
Voted
VISUALIZATION
2002
IEEE
15 years 2 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