Sciweavers

2354 search results - page 119 / 471
» Assignment Problems
Sort
View
CLASSIFICATION
2008
68views more  CLASSIFICATION 2008»
15 years 2 months ago
The Metric Cutpoint Partition Problem
Let G = (V, E, w) be a graph with vertex and edge sets V and E, respectively, and w : E IR+ a function which assigns a positive weight or length to each edge of G. G is called a r...
Alain Hertz, Sacha Varone
CVPR
2009
IEEE
16 years 9 months ago
A Stereo Approach that Handles the Matting Problem via Image Warping
We propose an algorithm that simultaneously extracts disparities and alpha matting information given a stereo image pair. Our method divides the reference image into a set of ov...
Michael Bleyer (Vienna University of Technology), ...
99
Voted
SOFSEM
2004
Springer
15 years 7 months ago
Measures of Intrinsic Hardness for Constraint Satisfaction Problem Instances
Our aim is to investigate the factors which determine the intrinsic hardness of constructing a solution to any particular constraint satisfaction problem instance, regardless of th...
George Boukeas, Constantinos Halatsis, Vassilis Zi...
JDA
2010
88views more  JDA 2010»
15 years 21 days ago
Greedy colorings for the binary paintshop problem
Cars have to be painted in two colors in a sequence where each car occurs twice; assign the two colors to the two occurrences of each car so as to minimize the number of color chan...
Hadis Amini, Frédéric Meunier, H&eac...
SIGCOMM
1997
ACM
15 years 6 months ago
Solutions to Hidden Terminal Problems in Wireless Networks
The floor acquisition multiple access (FAMA) discipline is analyzed in networks with hidden terminals. According to FAMA, control of the channel (the floor) is assigned to at mo...
Chane L. Fullmer, J. J. Garcia-Luna-Aceves