Sciweavers

409 search results - page 12 / 82
» Compact Similarity Joins
Sort
View
CVPR
2011
IEEE
12 years 11 months ago
Compact Hashing with Joint Optimization of Search Accuracy and Time
Similarity search, namely, finding approximate nearest neighborhoods, is the core of many large scale machine learning or vision applications. Recently, many research results dem...
Junfeng He, Regunathan Radhakrishnan, Shih-Fu Chan...
BIRD
2007
Springer
120views Bioinformatics» more  BIRD 2007»
14 years 1 months ago
Joining Softassign and Dynamic Programming for the Contact Map Overlap Problem
Comparison of 3-dimensional protein folds is a core problem in molecular biology. The Contact Map Overlap (CMO) scheme provides one of the most common measures for protein structur...
Brijnesh J. Jain, Michael Lappe
SIGMOD
1996
ACM
97views Database» more  SIGMOD 1996»
13 years 11 months ago
Bifocal Sampling for Skew-Resistant Join Size Estimation
This paper introduces bifocal sampling, a new technique for estimating the size of an equi-join of two relations. Bifocal sampling classi es tuples in each relation into two group...
Sumit Ganguly, Phillip B. Gibbons, Yossi Matias, A...
CVPR
2010
IEEE
13 years 9 months ago
Compact Projection: Simple and Efficient Near Neighbor Search with Practical Memory Requirements
Image similarity search is a fundamental problem in computer vision. Efficient similarity search across large image databases depends critically on the availability of compact ima...
Kerui Min, Linjun Yang, John Wright, Lei Wu, Xian-...
DATE
2006
IEEE
108views Hardware» more  DATE 2006»
14 years 1 months ago
Test compaction for transition faults under transparent-scan
Transparent-scan was proposed as an approach to test generation and test compaction for scan circuits. Its effectiveness was demonstrated earlier in reducing the test application ...
Irith Pomeranz, Sudhakar M. Reddy