Sciweavers

1363 search results - page 150 / 273
» The road coloring problem
Sort
View
COCO
2007
Springer
89views Algorithms» more  COCO 2007»
16 years 16 days ago
Testing Properties of Constraint-Graphs
We study a model of graph related formulae that we call the Constraint-Graph model. A constraintgraph is a labeled multi-graph (a graph where loops and parallel edges are allowed)...
Shirley Halevy, Oded Lachish, Ilan Newman, Dekel T...
CVPR
2006
IEEE
16 years 12 days ago
Video Completion by Motion Field Transfer
Existing methods for video completion typically rely on periodic color transitions, layer extraction, or temporally local motion. However, periodicity may be imperceptible or abse...
Takaaki Shiratori, Yasuyuki Matsushita, Xiaoou Tan...
ICPADS
2006
IEEE
16 years 11 days ago
Fast Convergence in Self-Stabilizing Wireless Networks
The advent of large scale multi-hop wireless networks highlights problems of fault tolerance and scale in distributed system, motivating designs that autonomously recover from tra...
Nathalie Mitton, Eric Fleury, Isabelle Guér...
COMPSAC
2005
IEEE
15 years 12 months ago
An Empirical Performance Study for Validating a Performance Analysis Approach: PSIM
Performance analysis gains more attention in recent years by researchers who focus their study on the early software development stages to mitigate the risk of redesign as problem...
Jinchun Xia, Yujia Ge, Carl K. Chang
FUN
2010
Springer
263views Algorithms» more  FUN 2010»
15 years 11 months ago
Kaboozle Is NP-complete, Even in a Strip
Abstract. Kaboozle is a puzzle consisting of several square cards, each annotated with colored paths and dots drawn on both sides and holes drilled. The goal is to join two colored...
Tetsuo Asano, Erik D. Demaine, Martin L. Demaine, ...