Sciweavers

678 search results - page 55 / 136
» Structural Properties of Sparse Graphs
Sort
View
ACTA
2006
74views more  ACTA 2006»
13 years 9 months ago
Linearly bounded infinite graphs
Linearly bounded Turing machines have been mainly studied as acceptors for context-sensitive languages. We define a natural family of canonical infinite automata representing their...
Arnaud Carayol, Antoine Meyer
MICS
2008
72views more  MICS 2008»
13 years 8 months ago
Dynamic Multi-level Overlay Graphs for Shortest Paths
Multi-level overlay graphs represent a speed-up technique for shortest paths computation which is based on a hierarchical decomposition of a weighted directed graph G. They have b...
Francesco Bruera, Serafino Cicerone, Gianlorenzo D...
AAAI
2008
13 years 11 months ago
Clustering on Complex Graphs
Complex graphs, in which multi-type nodes are linked to each other, frequently arise in many important applications, such as Web mining, information retrieval, bioinformatics, and...
Bo Long, Zhongfei (Mark) Zhang, Philip S. Yu, Tian...
KDD
2009
ACM
185views Data Mining» more  KDD 2009»
14 years 9 months ago
On compressing social networks
Motivated by structural properties of the Web graph that support efficient data structures for in memory adjacency queries, we study the extent to which a large network can be com...
Flavio Chierichetti, Ravi Kumar, Silvio Lattanzi, ...
SCIA
2007
Springer
119views Image Analysis» more  SCIA 2007»
14 years 3 months ago
Watertight Multi-view Reconstruction Based on Volumetric Graph-Cuts
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...
Mario Sormann, Christopher Zach, Joachim Bauer, Ko...