Sciweavers

156 search results - page 2 / 32
» Edge ranking of weighted trees
Sort
View
MST
2011
206views Hardware» more  MST 2011»
13 years 4 days ago
Weighted Logics for Unranked Tree Automata
: We define a weighted monadic second order logic for unranked trees and the concept of weighted unranked tree automata, and we investigate the expressive power of these two conce...
Manfred Droste, Heiko Vogler
WEBI
2005
Springer
13 years 10 months ago
WICER: A Weighted Inter-Cluster Edge Ranking for Clustered Graphs
Several algorithms based on link analysis have been developed to measure the importance of nodes on a graph such as pages on the World Wide Web. PageRank and HITS are the most pop...
Divya Padmanabhan, Prasanna Kumar Desikan, Jaideep...
SODA
2004
ACM
144views Algorithms» more  SODA 2004»
13 years 6 months ago
Covering minimum spanning trees of random subgraphs
We consider the problem of finding a sparse set of edges containing the minimum spanning tree (MST) of a random subgraph of G with high probability. The two random models that we ...
Michel X. Goemans, Jan Vondrák
GBRPR
2009
Springer
13 years 9 months ago
Homeomorphic Alignment of Edge-Weighted Trees
Abstract. Motion capture, a currently active research area, needs estimation of the pose of the subject. This requires a match between a model and the 3D shape, constructed using a...
Benjamin Raynal, Michel Couprie, Venceslas Biri
CPC
2010
64views more  CPC 2010»
13 years 5 months ago
Deterministic Edge Weights in Increasing Tree Families
Markus Kuba, Stephan Wagner