Sciweavers

63 search results - page 12 / 13
» A sublinear algorithm for weakly approximating edit distance
Sort
View
EOR
2007
364views more  EOR 2007»
14 years 9 months ago
Heuristics for the mirrored traveling tournament problem
Professional sports leagues are a major economic activity around the world. Teams and leagues do not want to waste their investments in players and structure in consequence of poo...
Celso C. Ribeiro, Sebastián Urrutia
CVPR
2000
IEEE
15 years 11 months ago
Reconstruction from Six-Point Sequences
An algorithm is given for computing projective structure from a set of six points seen in a sequence of many images. The method is based on the notion of duality between cameras a...
Richard I. Hartley, Nicolas Y. Dano
134
Voted
SCVMA
2004
Springer
15 years 2 months ago
Comparison of Edge-Driven Algorithms for Model-Based Motion Estimation
3D-model-based tracking offers one possibility to explicate the manner in which spatial coherence can be exploited for the analysis of image sequences. Two seemingly different ap...
Hendrik Dahlkamp, Artur Ottlik, Hans-Hellmut Nagel
ICDE
2006
IEEE
196views Database» more  ICDE 2006»
15 years 11 months ago
Closure-Tree: An Index Structure for Graph Queries
Graphs have become popular for modeling structured data. As a result, graph queries are becoming common and graph indexing has come to play an essential role in query processing. ...
Huahai He, Ambuj K. Singh
SIGMOD
2011
ACM
241views Database» more  SIGMOD 2011»
14 years 10 days ago
Neighborhood based fast graph search in large networks
Complex social and information network search becomes important with a variety of applications. In the core of these applications, lies a common and critical problem: Given a labe...
Arijit Khan, Nan Li, Xifeng Yan, Ziyu Guan, Supriy...