6740 search results - page 137 / 1348 » An s -Hamiltonian Line Graph Problem |
ICRA
1993
IEEE
14 years 2 months ago
1993
IEEE
Ordinarily, a robot workspace has insufficientroom to allow the setup of multiple applications simultaneously. As a result, it is common practice to use modular fixtures which hol...
SPLC
2007
13 years 11 months ago
2007
Managing variability is the essence of software product line (PL) practice. With many variant features and complex dependencies among them, it also becomes a major challenge for e...
CVPR
2004
IEEE
15 years 8 days ago
2004
IEEE
The problem of deciding whether two pixels in an image have the same real world color is a fundamental problem in computer vision. Many color spaces are used in different applicat...
ICA
2004
Springer
14 years 3 months ago
2004
Springer
Robust clustering of data into overlapping linear subspaces is a common problem. Here we consider one-dimensional subspaces that cross the origin. This problem arises in blind sour...
ICPR
2008
IEEE
14 years 11 months ago
2008
IEEE
In this paper we present a simple colorization method that relies on nonlocal graph regularization. We introduce nonlocal discrete differential operators and a family of weighted ...