Sciweavers

4137 search results - page 242 / 828
» On the number of matchings of a tree
Sort
View
CVPR
2008
IEEE
16 years 8 months ago
Accurate multi-view reconstruction using robust binocular stereo and surface meshing
This paper presents a new algorithm for multi-view reconstruction that demonstrates both accuracy and efficiency. Our method is based on robust binocular stereo matching, followed...
Derek Bradley, Tamy Boubekeur, Wolfgang Heidrich
AAECC
2009
Springer
150views Algorithms» more  AAECC 2009»
16 years 1 months ago
Rooted Trees Searching for Cocyclic Hadamard Matrices over D4t
A new reduction on the size of the search space for cocyclic Hadamard matrices over dihedral groups D4t is described, in terms of the so called central distribution. This new searc...
Víctor Álvarez, José Á...
CISS
2008
IEEE
16 years 1 months ago
Memory-constrained ML-optimal tree search detection
— In this paper, we propose a memory-constrained tree search (MCTS) algorithm for the detection in multiple-input multiple-output (MIMO) systems. The MCTS algorithm offers a wide...
Yongmei Dai, Zhiyuan Yan
ICDM
2006
IEEE
122views Data Mining» more  ICDM 2006»
16 years 22 days ago
Optimal Segmentation Using Tree Models
Sequence data are abundant in application areas such as computational biology, environmental sciences, and telecommunications. Many real-life sequences have a strong segmental str...
Robert Gwadera, Aristides Gionis, Heikki Mannila
MFCS
2005
Springer
16 years 6 days ago
D-Width: A More Natural Measure for Directed Tree Width
Due to extensive research on tree-width for undirected graphs and due to its many applications in various fields it has been a natural desire for many years to generalize the idea...
Mohammad Ali Safari