Sciweavers

3678 search results - page 274 / 736
» On the Stable Paths Problem
Sort
View
ICDCS
2009
IEEE
15 years 4 months ago
Selective Protection: A Cost-Efficient Backup Scheme for Link State Routing
In recent years, there are substantial demands to reduce packet loss in the Internet. Among the schemes proposed, finding backup paths in advance is considered to be an effective ...
Meijia Hou, Dan Wang, Mingwei Xu, Jiahai Yang
WALCOM
2010
IEEE
255views Algorithms» more  WALCOM 2010»
16 years 1 months ago
Harmonious Coloring on Subclasses of Colinear Graphs
Given a simple graph G, a harmonious coloring of G is a proper vertex coloring such that each pair of colors appears together on at most one edge. The harmonious chromatic number i...
Kyriaki Ioannidou, Stavros D. Nikolopoulos
ICCAD
2007
IEEE
165views Hardware» more  ICCAD 2007»
15 years 10 months ago
BioRoute: a network-flow based routing algorithm for digital microfluidic biochips
Due to the recent advances in microfluidics, digital microfluidic biochips are expected to revolutionize laboratory procedures. One critical problem for biochip synthesis is the dr...
Ping-Hung Yuh, Chia-Lin Yang, Yao-Wen Chang
CVPR
2007
IEEE
16 years 8 months ago
Shape from Planar Curves: A Linear Escape from Flatland
We revisit the problem of recovering 3D shape from the projection of planar curves on a surface. This problem is strongly motivated by perception studies. Applications include sin...
Ady Ecker, Kiriakos N. Kutulakos, Allan D. Jepson
CP
2009
Springer
16 years 1 months ago
Using Relaxations in Maximum Density Still Life
The Maximum Density Sill-Life Problem is to fill an n × n board of cells with the maximum number of live cells so that the board is stable under the rules of Conway’s Game of L...
Geoffrey Chu, Peter J. Stuckey, Maria Garcia de la...