Sciweavers

3270 search results - page 220 / 654
» Approximate String Processing
Sort
View
SODA
2008
ACM
101views Algorithms» more  SODA 2008»
15 years 4 months ago
Adaptive local ratio
Local ratio is a well-known paradigm for designing approximation algorithms for combinatorial optimization problems. At a very high level, a local-ratio algorithm first decomposes ...
Julián Mestre
RSKT
2010
Springer
15 years 1 months ago
Ordered Weighted Average Based Fuzzy Rough Sets
Traditionally, membership to the fuzzy-rough lower, resp. upper approximation is determined by looking only at the worst, resp. best performing object. Consequently, when applied t...
Chris Cornelis, Nele Verbiest, Richard Jensen
ICDE
2009
IEEE
219views Database» more  ICDE 2009»
16 years 4 months ago
Distance Oracles for Spatial Networks
The popularity of location-based services and the need to do real-time processing on them has led to an interest in performing queries on transportation networks, such as finding s...
Jagan Sankaranarayanan, Hanan Samet
SIGMOD
2006
ACM
121views Database» more  SIGMOD 2006»
15 years 9 months ago
Derby/S: a DBMS for sample-based query answering
Although approximate query processing is a prominent way to cope with the requirements of data analysis applications, current database systems do not provide integrated and compre...
Anja Klein, Rainer Gemulla, Philipp Rösch, Wo...
ICPR
2000
IEEE
15 years 7 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