Sciweavers

353 search results - page 31 / 71
» From graph states to two-graph states
Sort
View
ISCAS
2003
IEEE
124views Hardware» more  ISCAS 2003»
14 years 1 months ago
Convergent transfer subgraph characterization and computation
In this paper, we present a precise characterization of the existence of a convergent transfer subgraph in an edge colored directed acyclic graph. Based on the characterization, l...
Wing Ning Li
PODC
2009
ACM
14 years 8 months ago
A distributed polylogarithmic time algorithm for self-stabilizing skip graphs
Peer-to-peer systems rely on scalable overlay networks that enable efficient routing between its members. Hypercubic topologies facilitate such operations while each node only nee...
Riko Jacob, Andréa W. Richa, Christian Sche...
ICRA
2005
IEEE
142views Robotics» more  ICRA 2005»
14 years 1 months ago
Omnidirectional 3D Modeling on a Mobile Robot using Graph Cuts
— For a mobile robot it is a natural task to build a 3D model of its environment. Such a model is not only useful for planning robot actions but also to provide a remote human su...
Sven Fleck, Florian Busch, Peter Biber, Henrik And...
IJCV
2008
281views more  IJCV 2008»
13 years 8 months ago
Simultaneous Segmentation and Pose Estimation of Humans Using Dynamic Graph Cuts
Abstract This paper presents a novel algorithm for performing integrated segmentation and 3D pose estimation of a human body from multiple views. Unlike other state of the art meth...
Pushmeet Kohli, Jonathan Rihan, Matthieu Bray, Phi...
ECCC
2011
205views ECommerce» more  ECCC 2011»
13 years 2 months ago
Graphs of Bounded Treewidth can be Canonized in AC1
In recent results the complexity of isomorphism testing on graphs of bounded treewidth is improved to TC1 [GV06] and further to LogCFL [DTW10]. The computation of canonical forms ...
Fabian Wagner