202 search results - page 25 / 41 » Locally identifying coloring of graphs |
131
click to vote
VLSM
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. Given an image, digital matting consists in extracting a foreground element from the background. Standard methods are initialized with a trimap, a partition of the image ...
102
click to vote
ECRTS
2008
IEEE
15 years 6 months ago
2008
IEEE
Embedded services and applications that interact with the real world often, over time, need to run on different kinds of hardware (low-cost microcontrollers to powerful multicore ...
99
Voted
GECCO
2003
Springer
15 years 5 months ago
2003
Springer
We present a Kernighan-Lin style local improvement heuristic for genetic algorithms. We analyze the run-time cost of the heuristic. We demonstrate through experiments that the heur...
110
click to vote
NETWORK
2007
14 years 11 months ago
2007
If we abstract a sensor network as a network graph consisting of vertices and edges, where vertices represent sensor nodes and edges represent distance measurements between neighbo...
ECCV
2008
Springer
16 years 1 months ago
2008
Springer
Shadows are one of the most significant difficulties of the photometric stereo method. When four or more images are available, local surface orientation is overdetermined and the s...