Sciweavers

6740 search results - page 252 / 1348
» An s -Hamiltonian Line Graph Problem
Sort
View
3DPVT
2006
IEEE
239views Visualization» more  3DPVT 2006»
15 years 6 months ago
Self-Calibration of Multiple Laser Planes for 3D Scene Reconstruction
Self-calibration is one of the most active issues concerning vision-based 3D measurements. However, in the case of the light sectioning method, there has been little research cond...
Ryo Furukawa, Hiroshi Kawasaki
STACS
2007
Springer
15 years 6 months ago
Broadcasting vs. Mixing and Information Dissemination on Cayley Graphs
One frequently studied problem in the context of information dissemination in communication networks is the broadcasting problem. In this paper, we study the following randomized b...
Robert Elsässer, Thomas Sauerwald
96
Voted
ICDM
2005
IEEE
142views Data Mining» more  ICDM 2005»
15 years 6 months ago
Shortest-Path Kernels on Graphs
Data mining algorithms are facing the challenge to deal with an increasing number of complex objects. For graph data, a whole toolbox of data mining algorithms becomes available b...
Karsten M. Borgwardt, Hans-Peter Kriegel
GD
2004
Springer
15 years 6 months ago
Partitions of Complete Geometric Graphs into Plane Trees
Consider the following question: does every complete geometric graph K2n have a partition of its edge set into n plane spanning trees? We approach this problem from three directio...
Prosenjit Bose, Ferran Hurtado, Eduardo Rivera-Cam...
CORR
2012
Springer
176views Education» more  CORR 2012»
13 years 8 months ago
Capturing Topology in Graph Pattern Matching
Graph pattern matching is often defined in terms of subgraph isomorphism, an np-complete problem. To lower its complexity, various extensions of graph simulation have been consid...
Shuai Ma, Yang Cao, Wenfei Fan, Jinpeng Huai, Tian...