Sciweavers

447 search results - page 36 / 90
» Re-ranking search results using document-passage graphs
Sort
View
SISAP
2009
IEEE
149views Data Mining» more  SISAP 2009»
15 years 4 months ago
Combinatorial Framework for Similarity Search
—We present an overview of the combinatorial framework for similarity search. An algorithm is combinatorial if only direct comparisons between two pairwise similarity values are ...
Yury Lifshits
STOC
2010
ACM
228views Algorithms» more  STOC 2010»
15 years 2 months ago
On the searchability of small-world networks with arbitrary underlying structure
Revisiting the “small-world” experiments of the ’60s, Kleinberg observed that individuals are very effective at constructing short chains of acquaintances between any two p...
Pierre Fraigniaud and George Giakkoupis
ATAL
2006
Springer
15 years 1 months ago
No-commitment branch and bound search for distributed constraint optimization
We present a new polynomial-space algorithm for solving Distributed Constraint Optimization problems (DCOP). The algorithm, called NCBB, is branch and bound search with modificati...
Anton Chechetka, Katia P. Sycara
ML
2010
ACM
193views Machine Learning» more  ML 2010»
14 years 4 months ago
On the eigenvectors of p-Laplacian
Spectral analysis approaches have been actively studied in machine learning and data mining areas, due to their generality, efficiency, and rich theoretical foundations. As a natur...
Dijun Luo, Heng Huang, Chris H. Q. Ding, Feiping N...
ICMCS
2006
IEEE
170views Multimedia» more  ICMCS 2006»
15 years 3 months ago
3D Model Search Based on Stochastic ARG Matching
Due to the high performance of recent computer graphics hardware, 3D CG and CG animations have become in great demand for various applications. Many 3D models have already been cr...
Naoto Nakamura, Yoshihiro Okada, Koichi Niijima