Sciweavers

4911 search results - page 205 / 983
» Tree dependence analysis
Sort
View
CVPR
2010
IEEE
15 years 11 months ago
Globally Optimal Pixel Labeling Algorithms for Tree Metrics
We consider pixel labeling problems where the label set forms a tree, and where the observations are also labels. Such problems arise in feature-space analysis with a very large...
Pedro Felzenszwalb, Gyula Pap, Eva Tardos, Ramin Z...
110
Voted
ICDM
2006
IEEE
137views Data Mining» more  ICDM 2006»
15 years 9 months ago
Automatic Construction of N-ary Tree Based Taxonomies
Hierarchies are an intuitive and effective organization paradigm for data. Of late there has been considerable research on automatically learning hierarchical organizations of dat...
Kunal Punera, Suju Rajan, Joydeep Ghosh
CPM
2005
Springer
109views Combinatorics» more  CPM 2005»
15 years 9 months ago
Using PQ Trees for Comparative Genomics
Permutations on strings representing gene clusters on genomes have been studied earlier in [18, 14, 3, 12, 17] and the idea of a maximal permutation pattern was introduced in [12]....
Gad M. Landau, Laxmi Parida, Oren Weimann
114
Voted
APPROX
2004
Springer
136views Algorithms» more  APPROX 2004»
15 years 8 months ago
On the Crossing Spanning Tree Problem
Given an undirected n-node graph and a set C of m cuts, the minimum crossing tree is a spanning tree which minimizes the maximum crossing of any cut in C, where the crossing of a c...
Vittorio Bilò, Vineet Goyal, R. Ravi, Mohit...
ICPP
1994
IEEE
15 years 7 months ago
Computational Properties of Mesh Connected Trees: Versatile Architectures for Parallel Computation
Recently, the mesh connected trees (MCT) network has been proposed as a possible architecture for parallel computers. MCT networks are obtained by combining complete binary trees ...
Kemal Efe, Antonio Fernández