Sciweavers

1363 search results - page 132 / 273
» The road coloring problem
Sort
View
COCOON
1999
Springer
15 years 10 months ago
Multi-coloring Trees
Scheduling jobs with pairwise conflicts is modeled by the graph multicoloring problem. It occurs in two versions: in the preemptive case, each vertex may get any set of colors, w...
Magnús M. Halldórsson, Guy Kortsarz,...
ICCSA
2004
Springer
15 years 11 months ago
A Robust and Fast Algorithm for Computing Exact and Approximate Shortest Visiting Routes
Abstract. Given a simple n-sided polygon in the plane with a boundary partitioned into subchains some of which are convex and colored, we consider the following problem: Which is t...
Håkan Jonsson
ECCV
2010
Springer
15 years 10 months ago
Detection and Tracking of Large Number of Targets in Wide Area Surveillance
In this paper, we tackle the problem of object detection and tracking in a new and challenging domain of wide area surveillance. This problem poses several challenges: large camera...
ADAC
2008
193views more  ADAC 2008»
15 years 6 months ago
A constrained-optimization based half-quadratic algorithm for robustly fitting sets of linearly parametrized curves
We consider the problem of multiple fitting of linearly parametrized curves, that arises in many computer vision problems such as road scene analysis. Data extracted from images us...
Jean-Philippe Tarel, Sio-Song Ieng, Pierre Charbon...
BMVC
2010
15 years 4 months ago
Joint Optimisation for Object Class Segmentation and Dense Stereo Reconstruction
The problems of dense stereo reconstruction and object class segmentation can both be formulated as Conditional Random Field based labelling problems, in which every pixel in the ...
Lubor Ladicky, Paul Sturgess, Christopher Russell,...