Sciweavers

1279 search results - page 98 / 256
» Approximation Algorithms for Min-Max Generalization Problems
Sort
View
CPAIOR
2005
Springer
14 years 2 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...
ICALP
2005
Springer
14 years 2 months ago
Facility Location in Sublinear Time
Abstract. In this paper we present a randomized constant factor approximation algorithm for the problem of computing the optimal cost of the metric Minimum Facility Location proble...
Mihai Badoiu, Artur Czumaj, Piotr Indyk, Christian...
ANOR
2002
100views more  ANOR 2002»
13 years 8 months ago
A Limited-Memory Multipoint Symmetric Secant Method for Bound Constrained Optimization
A new algorithm for solving smooth large-scale minimization problems with bound constraints is introduced. The way of dealing with active constraints is similar to the one used in...
Oleg P. Burdakov, José Mario Martíne...
COMPGEOM
2011
ACM
13 years 13 days ago
Compressive sensing with local geometric features
We propose a framework for compressive sensing of images with local geometric features. Specifically, let x ∈ RN be an N-pixel image, where each pixel p has value xp. The image...
Rishi Gupta, Piotr Indyk, Eric Price, Yaron Rachli...
COMPGEOM
2004
ACM
14 years 2 months ago
Locality-sensitive hashing scheme based on p-stable distributions
We present a novel Locality-Sensitive Hashing scheme for the Approximate Nearest Neighbor Problem under ÐÔ norm, based on Ôstable distributions. Our scheme improves the running...
Mayur Datar, Nicole Immorlica, Piotr Indyk, Vahab ...