401 search results - page 47 / 81 » Sparse Quasi-Random Graphs |
SCIA
2007
Springer
14 years 1 months ago
2007
Springer
This paper proposes a fast 3D reconstruction approach for efficiently generating watertight 3D models from multiple short baseline views. Our method is based on the combination of...
CP
2004
Springer
14 years 1 months ago
2004
Springer
Many backtracking algorithms exhibit heavy-tailed distributions, in which their running time is often much longer than their median. We analyze the behavior of two natural variant...
STOC
1998
ACM
14 years 7 hour ago
1998
ACM
In [6], Gallager introduces a family of codes based on sparse bipartite graphs, which he calls low-density parity-check codes. He suggests a natural decoding algorithm for these c...
TCSV
2008
13 years 7 months ago
2008
Object tracking is one of the fundamental problems in computer vision and has received considerable attention in the past two decades. The success of a tracking algorithm relies on...
ICDM
2007
IEEE
14 years 2 months ago
2007
IEEE
ASALSAN is a new algorithm for computing three-way DEDICOM, which is a linear algebra model for analyzing intrinsically asymmetric relationships, such as trade among nations or th...