Sciweavers

676 search results - page 25 / 136
» On Approximation Lower Bounds for TSP with Bounded Metrics
Sort
View
TSP
2008
71views more  TSP 2008»
14 years 11 months ago
Multiple Description Trellis-Coded Quantization of Sinusoidal Parameters
A new scheme for sinusoidal audio coding named multiple description spherical trellis-coded quantization is proposed and analytic expressions for the point densities and expected d...
Morten Holm Larsen, Mads Græsbøll Chr...
ICDE
2000
IEEE
168views Database» more  ICDE 2000»
16 years 1 months ago
PAC Nearest Neighbor Queries: Approximate and Controlled Search in High-Dimensional and Metric Spaces
In high-dimensional and complex metric spaces, determining the nearest neighbor (NN) of a query object ? can be a very expensive task, because of the poor partitioning operated by...
Paolo Ciaccia, Marco Patella
CPAIOR
2005
Springer
15 years 5 months ago
Filtering Algorithms for the NValue Constraint
Abstract. The NValue constraint counts the number of different values assigned to a vector of variables. Propagating generalized arc consistency on this constraint is NP-hard. We ...
Christian Bessière, Emmanuel Hebrard, Brahi...
ICONIP
2004
15 years 1 months ago
An Auxiliary Variational Method
Variational methods have proved popular and effective for inference and learning in intractable graphical models. An attractive feature of the approaches based on the Kullback-Lei...
Felix V. Agakov, David Barber
STOC
2006
ACM
138views Algorithms» more  STOC 2006»
16 years 1 days ago
Searching dynamic point sets in spaces with bounded doubling dimension
We present a new data structure that facilitates approximate nearest neighbor searches on a dynamic set of points in a metric space that has a bounded doubling dimension. Our data...
Richard Cole, Lee-Ad Gottlieb