Sciweavers

1054 search results - page 156 / 211
» Fast Approximated SIFT
Sort
View
SIGMOD
2010
ACM
324views Database» more  SIGMOD 2010»
15 years 9 months ago
Similarity search and locality sensitive hashing using ternary content addressable memories
Similarity search methods are widely used as kernels in various data mining and machine learning applications including those in computational biology, web search/clustering. Near...
Rajendra Shinde, Ashish Goel, Pankaj Gupta, Debojy...
FUN
2010
Springer
233views Algorithms» more  FUN 2010»
15 years 9 months ago
The Complexity of Flood Filling Games
We study the complexity of the popular one player combinatorial game known as Flood-It. In this game the player is given an n×n board of tiles where each tile is allocated one of ...
David Arthur, Raphaël Clifford, Markus Jalsen...
SIGMOD
1998
ACM
96views Database» more  SIGMOD 1998»
15 years 8 months ago
Wavelet-Based Histograms for Selectivity Estimation
Query optimization is an integral part of relational database management systems. One important task in query optimization is selectivity estimation, that is, given a query P, we ...
Yossi Matias, Jeffrey Scott Vitter, Min Wang
CPM
2005
Springer
100views Combinatorics» more  CPM 2005»
15 years 6 months ago
Hardness of Optimal Spaced Seed Design
Abstract. Speeding up approximate pattern matching is a line of research in stringology since the 80’s. Practically fast approaches belong to the class of filtration algorithms,...
François Nicolas, Eric Rivals
FOCM
2002
140views more  FOCM 2002»
15 years 4 months ago
Adaptive Wavelet Methods II - Beyond the Elliptic Case
This paper is concerned with the design and analysis of adaptive wavelet methods for systems of operator equations. Its main accomplishment is to extend the range of applicability...
Albert Cohen, Wolfgang Dahmen, Ronald A. DeVore