Sciweavers

2107 search results - page 96 / 422
» Computing Small Search Numbers in Linear Time
Sort
View
IJHPCA
2010
84views more  IJHPCA 2010»
15 years 1 months ago
Operation Stacking for Ensemble Computations With Variable Convergence
Sparse matrix operations achieve only small fractions of peak CPU speeds because of the use of specialized, indexbased matrix representations, which degrade cache utilization by i...
Mehmet Belgin, Godmar Back, Calvin J. Ribbens
127
Voted
CVPR
2007
IEEE
16 years 5 months ago
Recognizing objects by piecing together the Segmentation Puzzle
We present an algorithm that recognizes objects of a given category using a small number of hand segmented images as references. Our method first over segments an input image into...
Jianbo Shi, Timothée Cour
ICPR
2010
IEEE
15 years 1 months ago
User Adaptive Clustering for Large Image Databases
Abstract--Searching large image databases is a time consuming process when done manually. Current CBIR methods mostly rely on training data in specific domains. When source and dom...
Mohammad Mehdi Saboorian, Mansour Jamzad, Hamid R....
138
Voted
ECCV
2002
Springer
16 years 5 months ago
Multi-view Matching for Unordered Image Sets, or "How Do I Organize My Holiday Snaps?"
There has been considerable success in automated reconstruction for image sequences where small baseline algorithms can be used to establish matches across a number of images. In c...
Frederik Schaffalitzky, Andrew Zisserman
TIME
2006
IEEE
15 years 9 months ago
DyST: Dynamic and Scalable Temporal Text Indexing
An increasing number of documents in companies and other organizations are now only available electronically, and exist in several versions updated at different times. In order to...
Kjetil Nørvåg, Albert Overskeid Nyb&o...