Sciweavers

1016 search results - page 51 / 204
» Generalized distances between rankings
Sort
View
ACCV
2007
Springer
15 years 7 months ago
Accelerating Pattern Matching or How Much Can You Slide?
This paper describes a method that accelerates pattern matching. The distance between a pattern and a window is usually close to the distance of the pattern to the adjacement windo...
Ofir Pele, Michael Werman
135
Voted
ICASSP
2010
IEEE
15 years 28 days ago
Searching with expectations
Handling large amounts of data, such as large image databases, requires the use of approximate nearest neighbor search techniques. Recently, Hamming embedding methods such as spec...
Harsimrat Sandhawalia, Herve Jegou
AIR
2006
76views more  AIR 2006»
15 years 24 days ago
Evolved term-weighting schemes in Information Retrieval: an analysis of the solution space
Evolutionary computation techniques are increasingly being applied to problems within Information Retrieval (IR). Genetic programming (GP) has previously been used with some succe...
Ronan Cummins, Colm O'Riordan
120
Voted
KDD
2009
ACM
228views Data Mining» more  KDD 2009»
16 years 1 months ago
A generalized Co-HITS algorithm and its application to bipartite graphs
Recently many data types arising from data mining and Web search applications can be modeled as bipartite graphs. Examples include queries and URLs in query logs, and authors and ...
Hongbo Deng, Michael R. Lyu, Irwin King
115
Voted
RECOMB
2007
Springer
16 years 1 months ago
Free Energy Estimates of All-Atom Protein Structures Using Generalized Belief Propagation
We present a technique for approximating the free energy of protein structures using Generalized Belief Propagation (GBP). The accuracy and utility of these estimates are then demo...
Hetunandan Kamisetty, Eric P. Xing, Christopher Ja...