Sciweavers

1220 search results - page 75 / 244
» Minimal Interval Completions
Sort
View
COCOA
2008
Springer
13 years 11 months ago
Stochastic Online Scheduling Revisited
We consider the problem of minimizing the total weighted completion time on identical parallel machines when jobs have stochastic processing times and may arrive over time. We give...
Andreas S. Schulz
COR
2008
69views more  COR 2008»
13 years 9 months ago
Single-machine group scheduling problems with deterioration consideration
In many realistic situations, a job processed later consumes more time than the same job when it is processed earlier; this phenomenon is known as deteriorating jobs. However, job...
Chin-Chia Wu, Yau-Ren Shiau, Wen-Chiung Lee
ICCV
2009
IEEE
15 years 2 months ago
Modeling Deformable Objects from a Single Depth Camera
We propose a novel approach to reconstruct complete 3D deformable models over time by a single depth camera, provided that most parts of the models are observed by the camera at...
Miao Liao, Qing Zhang, Huamin Wang, Ruigang Yang, ...
CSR
2007
Springer
14 years 3 months ago
On the Complexity of Matrix Rank and Rigidity
We revisit a well studied linear algebraic problem, computing the rank and determinant of matrices, in order to obtain completeness results for small complexity classes. In partic...
Meena Mahajan, Jayalal M. N. Sarma
FSS
2008
94views more  FSS 2008»
13 years 9 months ago
Lattices of convex normal functions
The algebra of truth values of type-2 fuzzy sets is the set of all functions from the unit interval into itself, with operations de ned in terms of certain convolutions of these f...
John Harding, Carol L. Walker, Elbert A. Walker