Sciweavers

1749 search results - page 292 / 350
» Conditional colorings of graphs
Sort
View
DM
1998
68views more  DM 1998»
15 years 6 months ago
Alternating cycles and trails in 2-edge-coloured complete multigraphs
We consider edge-coloured multigraphs. A trail in such a multigraph is alternating if its successive edges differ in colour. Let G be a 2-edge-coloured complete graph and let M b...
Jørgen Bang-Jensen, Gregory Gutin
NETWORKS
2007
15 years 5 months ago
Vertex disjoint routings of cycles over tori
We study the problem of designing a survivable WDM network based on covering the communication requests with subnetworks that are protected independently from each other. We consi...
Jean-Claude Bermond, Min-Li Yu
CVPR
2009
IEEE
1148views Computer Vision» more  CVPR 2009»
17 years 1 months ago
Shape Constrained Figure-Ground Segmentation and Tracking
Global shape information is an effective top-down complement to bottom-up figure-ground segmentation as well as a useful constraint to avoid drift during adaptive tracking. We p...
Zhaozheng Yin, Robert T. Collins
ICRA
2010
IEEE
138views Robotics» more  ICRA 2010»
15 years 4 months ago
Planning for autonomous door opening with a mobile manipulator
Abstract— Computing a motion that enables a mobile manipulator to open a door is challenging because it requires tight coordination between the motions of the arm and the base. H...
Sachin Chitta, Benjamin J. Cohen, Maxim Likhachev
INFOCOM
2010
IEEE
15 years 4 months ago
VBS: Maximum Lifetime Sleep Scheduling for Wireless Sensor Networks Using Virtual Backbones
—Wireless sensor network (WSN) applications require redundant sensors to guarantee fault tolerance. However, the same degree of redundancy is not necessary for multi-hop communic...
Yaxiong Zhao, Jie Wu, Feng Li, Sanglu Lu