836 search results - page 35 / 168 » On the Complexity of Train Assignment Problems |
125
click to vote
ICIP
2003
IEEE
16 years 5 months ago
2003
IEEE
We propose an information-theoretic method for multi-phase image segmentation, in an active contour-based framework. Our approach is based on nonparametric density estimates, and ...
172
click to vote
WSC
2008
15 years 6 months ago
2008
The Swedish Postal Services receives and distributes over 22 million pieces of mail every day. Mail transportation takes place overnight by airplanes, trains, trucks, and cars in ...
129
Voted
JSAC
2006
15 years 3 months ago
2006
We consider the problem of traffic grooming in WDM path, star, and tree networks. Traffic grooming is a variant of the well-known logical topology design, and is concerned with the...
143
click to vote
ICALP
2007
Springer
15 years 10 months ago
2007
Springer
We present algebraic conditions on constraint languages Γ that ensure the hardness of the constraint satisfaction problem CSP(Γ) for complexity classes L, NL, P, NP and ModpL. Th...
123
click to vote
ICAC
2007
IEEE
15 years 10 months ago
2007
IEEE
An autonomic problem determination system can adapt to changing environments, react to existing or new error condition and predict possible problems. In this report, we propose su...