Sciweavers

1984 search results - page 10 / 397
» The colourful feasibility problem
Sort
View
ICALP
2003
Springer
14 years 3 months ago
Multicommodity Demand Flow in a Tree
We consider requests for capacity in a given tree network T = (V, E) where each edge of the tree has some integer capacity ue. Each request consists of an integer demand df and a ...
Chandra Chekuri, Marcelo Mydlarz, F. Bruce Shepher...
DAM
1998
77views more  DAM 1998»
13 years 9 months ago
Optimal Wavelength-routed Multicasting
Motivated by wavelength division multiplexing in all-optical networks, we consider the problem of finding a set of paths from a fixed source to a multiset of destinations, which c...
Bruno Beauquier, Pavol Hell, Stephane Perennes
BMVC
2001
14 years 7 days ago
Illumination-Invariant Motion Detection Using Colour Mixture Models
This paper tackles the problem of robust change detection in image sequences from static cameras. Motion cues are detected using frame differencing with an adaptive background est...
Ming Xu, Tim Ellis
CVIU
2010
155views more  CVIU 2010»
13 years 10 months ago
Illumination-robust variational optical flow using cross-correlation
We address the problem of variational optical flow for video processing applications that need fast operation and robustness to drastic variations in illumination. Recently, a sol...
József Molnár, Dmitry Chetverikov, S...
DICTA
2003
13 years 11 months ago
Embedded Voxel Colouring
Abstract. The reconstruction of a complex scene from multiple images is a fundamental problem in the field of computer vision. Volumetric methods have proven to be a strong altern...
Carlos Leung, Ben Appleton, Changming Sun