Sciweavers

247 search results - page 32 / 50
» Scaling up all pairs similarity search
Sort
View
DAWAK
2000
Springer
15 years 10 months ago
COFE: A Scalable Method for Feature Extraction from Complex Objects
Abstract. Feature Extraction, also known as Multidimensional Scaling, is a basic primitive associated with indexing, clustering, nearest neighbor searching and visualization. We co...
Gabriela Hristescu, Martin Farach-Colton
SIGIR
2005
ACM
15 years 11 months ago
Web-based acquisition of Japanese katakana variants
This paper describes a method of detecting Japanese Katakana variants from a large corpus. Katakana words, which are mainly used as loanwords, cause problems with information retr...
Takeshi Masuyama, Hiroshi Nakagawa
CANDC
2005
ACM
15 years 6 months ago
Integer linear programming as a tool for constructing trees from quartet data
The task of the quartet puzzling problem is to find a best-fitting binary X-tree for a finite n-set from confidence values for the 3 n 4 binary trees with exactly four leaves from...
Jan Weyer-Menkhoff, Claudine Devauchelle, Alexande...
CVPR
2012
IEEE
13 years 8 months ago
Spherical hashing
Many binary code encoding schemes based on hashing have been actively studied recently, since they can provide efficient similarity search, especially nearest neighbor search, an...
Jae-Pil Heo, Youngwoon Lee, Junfeng He, Shih-Fu Ch...
EPEW
2008
Springer
15 years 7 months ago
Evaluation of P2P Algorithms for Probabilistic Trust Inference in a Web of Trust
The problem of finding trust paths and estimating the trust one can place in a partner arises in various application areas, including virtual organisations, authentication systems ...
Huqiu Zhang, Aad P. A. van Moorsel