Sciweavers

475 search results - page 27 / 95
» Efficient Set Similarity Joins Using Min-prefixes
Sort
View
WWW
2005
ACM
14 years 8 months ago
LSH forest: self-tuning indexes for similarity search
We consider the problem of indexing high-dimensional data for answering (approximate) similarity-search queries. Similarity indexes prove to be important in a wide variety of sett...
Mayank Bawa, Tyson Condie, Prasanna Ganesan
ICPR
2008
IEEE
14 years 8 months ago
Fingerprint indexing based on composite set of reduced SIFT features
Most of current fingerprint indexing schemes utilize features based on global textures and minutiae structures. To extend the existing technology of feature extraction, this paper...
Xin Shuai, Chao Zhang, Pengwei Hao
JUCS
2008
185views more  JUCS 2008»
13 years 7 months ago
Recognising Informative Web Page Blocks Using Visual Segmentation for Efficient Information Extraction
Abstract: As web sites are getting more complicated, the construction of web information extraction systems becomes more troublesome and time-consuming. A common theme is the diffi...
Jinbeom Kang, Joongmin Choi
SIGMOD
2002
ACM
219views Database» more  SIGMOD 2002»
14 years 7 months ago
Efficient k-NN search on vertically decomposed data
Applications like multimedia retrieval require efficient support for similarity search on large data collections. Yet, nearest neighbor search is a difficult problem in high dimen...
Arjen P. de Vries, Nikos Mamoulis, Niels Nes, Mart...
CAIP
2007
Springer
134views Image Analysis» more  CAIP 2007»
13 years 11 months ago
An Efficient Method for Filtering Image-Based Spam E-mail
Spam e-mail with advertisement text embedded in images presents a great challenge to anti-spam filters. In this paper, we present a fast method to detect image-based spam e-mail. U...
Ngo Phuong Nhung, Tu Minh Phuong