Sciweavers

1652 search results - page 116 / 331
» Matching Vector Codes
Sort
View
SPAA
1993
ACM
15 years 3 months ago
Asymptotically Tight Bounds for Performing BMMC Permutations on Parallel Disk Systems
d Abstract) Thomas H. Cormen Leonard F. Wisniewski Department of Mathematics and Computer Science Dartmouth College We give asymptotically equal lower and upper bounds for the num...
Thomas H. Cormen, Leonard F. Wisniewski
ISMB
2003
15 years 27 days ago
PSI: indexing protein structures for fast similarity search
We consider the problem of finding similarities in protein structure databases. Our techniques extract feature vectors on triplets of SSEs (Secondary Structure Elements). Later, ...
Orhan Çamoglu, Tamer Kahveci, Ambuj K. Sing...
WSCG
2001
91views more  WSCG 2001»
15 years 27 days ago
Fast Hybrid Block- and Pixel- Recursive Disparity Analysis for Real-Time Applications in Immersive Tele-Conference Scenarios
This paper presents a fast disparity analysis approach based on a hybrid block- and pixel-recursive matching scheme. The key idea is to choose efficiently a small number of candid...
Peter Kauff, Nicole Brandenburg, Michael Karl, Oli...
ICML
2006
IEEE
16 years 10 days ago
Permutation invariant SVMs
We extend Support Vector Machines to input spaces that are sets by ensuring that the classifier is invariant to permutations of subelements within each input. Such permutations in...
Pannagadatta K. Shivaswamy, Tony Jebara
WWW
2003
ACM
16 years 6 days ago
Scaling personalized web search
Recent web search techniques augment traditional text matching with a global notion of "importance" based on the linkage structure of the web, such as in Google's P...
Glen Jeh, Jennifer Widom