Sciweavers

1125 search results - page 75 / 225
» On the job rotation problem
Sort
View
NIPS
2008
15 years 8 months ago
Covariance Estimation for High Dimensional Data Vectors Using the Sparse Matrix Transform
Covariance estimation for high dimensional vectors is a classically difficult problem in statistical analysis and machine learning. In this paper, we propose a maximum likelihood ...
Guangzhi Cao, Charles A. Bouman
JCO
2000
116views more  JCO 2000»
15 years 6 months ago
Multi-phase Algorithms for Throughput Maximization for Real-Time Scheduling
We consider the problem of off-line throughput maximization for job scheduling on one or more machines, where each job has a release time, a deadline and a profit. Most of the ver...
Piotr Berman, Bhaskar DasGupta
ECCV
2004
Springer
16 years 8 months ago
A Closed-Form Solution to Non-rigid Shape and Motion Recovery
Recovery of three dimensional (3D) shape and motion of non-static scenes from a monocular video sequence is important for applications like robot navigation and human computer inte...
Jing Xiao, Jinxiang Chai, Takeo Kanade
APPROX
2007
Springer
137views Algorithms» more  APPROX 2007»
16 years 1 months ago
A Knapsack Secretary Problem with Applications
We consider situations in which a decision-maker with a fixed budget faces a sequence of options, each with a cost and a value, and must select a subset of them online so as to ma...
Moshe Babaioff, Nicole Immorlica, David Kempe, Rob...
WAOA
2010
Springer
256views Algorithms» more  WAOA 2010»
15 years 4 months ago
The Train Delivery Problem - Vehicle Routing Meets Bin Packing
Abstract. We consider the train delivery problem which is a generalization of the bin packing problem and is equivalent to a one dimensional version of the vehicle routing problem ...
Aparna Das, Claire Mathieu, Shay Mozes