Sciweavers

863 search results - page 64 / 173
» Links in edge-colored graphs
Sort
View
INFOCOM
2005
IEEE
14 years 2 months ago
Linear time construction of redundant trees for recovery schemes enhancing QoP and QoS
— Medard, Finn, Barry and Gallager proposed an elegant recovery scheme (known as the MFBG scheme) using redundant trees. Xue, Chen and Thulasiraman extended the MFBG scheme and i...
Weiyi Zhang, Guoliang Xue, Jian Tang, Krishnaiyan ...
SPIRE
2009
Springer
14 years 3 months ago
k2-Trees for Compact Web Graph Representation
The directed graph representation of the World Wide Web has been extensively used to analyze the Web structure, behavior and evolution. However, those graphs are huge and do not ï...
Nieves R. Brisaboa, Susana Ladra, Gonzalo Navarro
KDD
2007
ACM
154views Data Mining» more  KDD 2007»
14 years 9 months ago
An event-based framework for characterizing the evolutionary behavior of interaction graphs
Interaction graphs are ubiquitous in many fields such as bioinformatics, sociology and physical sciences. There have been many studies in the literature targeted at studying and m...
Sitaram Asur, Srinivasan Parthasarathy, Duygu Ucar
ICIAR
2007
Springer
14 years 2 months ago
Landmark-Based Non-rigid Registration Via Graph Cuts
Abstract. This paper presents an approach based on graph cuts initially used for motion segmentation that is being applied to the nonrigid registration problem. The main contributi...
Herve Lombaert, Yiyong Sun, Farida Cheriet
CVPR
2010
IEEE
14 years 5 months ago
Authority-Shift Clustering: Hierarchical Clustering by Authority Seeking on Graphs
In this paper, a novel hierarchical clustering method using link analysis techniques is introduced. The algorithm is formulated as an authority seeking procedure on graphs, which c...
Minsu Cho (Seoul National University), Kyoung Mu L...