Sciweavers

106 search results - page 2 / 22
» Fast Approximate Point Set Matching for Information Retrieva...
Sort
View
GIS
2006
ACM
14 years 5 months ago
Index for fast retrieval of uncertain spatial point data
Location information gathered from a variety of sources in the form of sensor data, video streams, human observations, and so on, is often imprecise and uncertain and needs to be ...
Dmitri V. Kalashnikov, Yiming Ma, Sharad Mehrotra,...
CPM
1998
Springer
209views Combinatorics» more  CPM 1998»
13 years 9 months ago
A Fast Bit-Vector Algorithm for Approximate String Matching Based on Dynamic Programming
The approximate string matching problem is to find all locations at which a query of length m matches a substring of a text of length n with k-or-fewer differences. Simple and prac...
Gene Myers
SCAM
2007
IEEE
13 years 11 months ago
Fast Approximate Matching of Programs for Protecting Libre/Open Source Software by Using Spatial Indexes
To encourage open source/libre software development, it is desirable to have tools that can help to identify open source license violations. This paper describes the implementatio...
Arnoldo José Müller Molina, Takeshi Sh...
ICDE
2002
IEEE
209views Database» more  ICDE 2002»
14 years 6 months ago
Geometric-Similarity Retrieval in Large Image Bases
We propose a novel approach to shape-based image retrieval that builds upon a similarity criterion which is based on the average point set distance. Compared to traditional techni...
Ioannis Fudos, Leonidas Palios, Evaggelia Pitoura
KDD
2009
ACM
611views Data Mining» more  KDD 2009»
14 years 5 months ago
Fast approximate spectral clustering
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-s...
Donghui Yan, Ling Huang, Michael I. Jordan