Sciweavers

2880 search results - page 85 / 576
» Approximate Range Searching
Sort
View
ISMIR
2005
Springer
154views Music» more  ISMIR 2005»
15 years 8 months ago
Exploiting the Tradeoff Between Precision and Cpu-Time to Speed Up Nearest Neighbor Search
We describe a recursive algorithm to quickly compute the N nearest neighbors according to a similarity measure in a metric space. The algorithm exploits an intrinsic property of a...
Pierre Roy, Jean-Julien Aucouturier, Franço...
ISAAC
2009
Springer
140views Algorithms» more  ISAAC 2009»
15 years 9 months ago
Tighter Approximation Bounds for Minimum CDS in Wireless Ad Hoc Networks
Abstract. Connected dominating set (CDS) has a wide range of applications in wireless ad hoc networks. A number of approximation algorithms for constructing a small CDS in wireless...
Minming Li, Peng-Jun Wan, F. Frances Yao
FPL
2004
Springer
93views Hardware» more  FPL 2004»
15 years 8 months ago
Second Order Function Approximation Using a Single Multiplication on FPGAs
Abstract. This paper presents a new scheme for the hardware evaluation of elementary functions, based on a piecewise second order minimax approximation. The novelty is that this ev...
Jérémie Detrey, Florent de Dinechin
ESA
2008
Springer
100views Algorithms» more  ESA 2008»
15 years 5 months ago
Improved Approximation Algorithms for Relay Placement
In the relay placement problem the input is a set of sensors and a number r 1, the communication range of a relay. In the one-tier version of the problem the objective is to place...
Alon Efrat, Sándor P. Fekete, Poornananda R...
112
Voted
NIPS
2000
15 years 4 months ago
APRICODD: Approximate Policy Construction Using Decision Diagrams
We propose a method of approximate dynamic programming for Markov decision processes (MDPs) using algebraic decision diagrams (ADDs). We produce near-optimal value functions and p...
Robert St-Aubin, Jesse Hoey, Craig Boutilier