Sciweavers

6110 search results - page 341 / 1222
» Approximate Computing
Sort
View
ICPR
2004
IEEE
16 years 7 months ago
Historical Document Image Enhancement Using Background Light Intensity Normalization
This paper presents a new background light intensity normalization algorithm suitable for historical document images. The algorithm uses an adaptive linear function to approximate...
Venu Govindaraju, Zhixin Shi
COMPGEOM
2004
ACM
16 years 4 days 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 ...
166
Voted
MOR
2006
95views more  MOR 2006»
15 years 6 months ago
An Efficient Interior-Point Method for Convex Multicriteria Optimization Problems
In multicriteria optimization, several objective functions, conflicting with each other, have to be minimized simultaneously. We propose a new efficient method for approximating t...
Jörg Fliege
APPROX
2009
Springer
142views Algorithms» more  APPROX 2009»
16 years 1 months ago
Optimal Sherali-Adams Gaps from Pairwise Independence
Abstract. This work considers the problem of approximating fixed predicate constraint satisfaction problems (MAX k-CSP(P)). We show that if the set of assignments accepted by P co...
Konstantinos Georgiou, Avner Magen, Madhur Tulsian...
ICPR
2000
IEEE
15 years 11 months ago
Modeling Range Images with Bounded Error Triangular Meshes without Optimization
This paper presents a new technique for approximating range images by means of adaptive triangular meshes with a bounded approximation error and without applying optimization. Thi...
Angel Domingo Sappa, Miguel Angel García