Sciweavers

331 search results - page 7 / 67
» Fast Matching for All Pairs Similarity Search
Sort
View
SIGMOD
1997
ACM
127views Database» more  SIGMOD 1997»
15 years 1 months ago
Fast Parallel Similarity Search in Multimedia Databases
Most similarity search techniques map the data objects into some high-dimensional feature space. The similarity search then corresponds to a nearest-neighbor search in the feature...
Stefan Berchtold, Christian Böhm, Bernhard Br...
COMPGEOM
2008
ACM
14 years 11 months ago
Embedding and similarity search for point sets under translation
Pattern matching in point sets is a well studied problem with numerous applications. We assume that the point sets may contain outliers (missing or spurious points) and are subjec...
Minkyoung Cho, David M. Mount
GFKL
2005
Springer
142views Data Mining» more  GFKL 2005»
15 years 3 months ago
Near Similarity Search and Plagiarism Analysis
Abstract. Existing methods to text plagiarism analysis mainly base on “chunking”, a process of grouping a text into meaningful units each of which gets encoded by an integer nu...
Benno Stein, Sven Meyer zu Eissen
DASFAA
2006
IEEE
153views Database» more  DASFAA 2006»
15 years 3 months ago
DAPSS: Exact Subsequence Matching for Data Streams
There is much interest in the processing of data streams for applications in the fields such as financial analysis, network monitoring, mobile services, and sensor network manage...
Yasuhiro Fujiwara, Yasushi Sakurai, Masashi Yamamu...
MVA
1998
230views Computer Vision» more  MVA 1998»
14 years 11 months ago
An Efficient Matching Algorithm for Segment-Based Stereo Vision Using Dynamic Programming Technique
An efficient matching method for segment-based stereo vision is proposed. A potential matching graph which describes the connectivity between candidate matching pairs of segments ...
Toshio Ueshiba, Yoshihiro Kawai, Yasushi Sumi, Fum...