2612 search results - page 163 / 523 » Switching Graphs and Their Complexity |
108
Voted
CVPR
2006
IEEE
16 years 2 months ago
2006
IEEE
Recently, the generative modeling approach to video segmentation has been gaining popularity in the computer vision community. For example, the flexible sprites framework has been...
106
click to vote
AVI
2004
15 years 2 months ago
2004
Our studies have shown that as displays become larger, users leave more windows open for easy multitasking. A larger number of windows, however, may increase the time that users s...
77
Voted
CORR
2007
Springer
15 years 24 days ago
2007
Springer
We introduce S-DUDE, a new algorithm for denoising Discrete Memoryless Channel (DMC)-corrupted data. The algorithm, which generalizes the recently introduced DUDE (Discrete Univer...
116
Voted
COMPGEOM
2010
ACM
15 years 6 months ago
2010
ACM
Let D be a weighted directed graph cellularly embedded in a surface of genus g, orientable or not, possibly with boundary. We describe algorithms to compute a shortest non-contrac...
82
Voted
ESA
2008
Springer
15 years 2 months ago
2008
Springer
We consider a planning problem that generalizes Alcuin's river crossing problem (also known as: The wolf, goat, and cabbage puzzle) to scenarios with arbitrary conflict graph...