1220 search results - page 19 / 244 » Minimal Interval Completions |
COR
2007
13 years 7 months ago
2007
The p-center problem is to locate p facilities in a network of n demand points so as to minimize the longest distance between a demand point and its nearest facility. We consider ...
ANOR
2011
12 years 11 months ago
2011
This paper proposes a new methodology to schedule activities in projects with stochastic activity durations. The main idea is to determine for each activity an interval in which th...
SIGGRAPH
1993
ACM
13 years 11 months ago
1993
ACM
We present an efficient and robust algorithm for finding points of collision between time-dependent parametric and implicit surfaces. The algorithm detects simultaneous collisio...
CORR
2011
Springer
12 years 11 months ago
2011
Springer
The process of rank aggregation is intimately intertwined with the structure of skew-symmetric matrices. We apply recent advances in the theory and algorithms of matrix completion...
TVCG
2010
13 years 2 months ago
2010
Efficient multiresolution representations for isosurfaces and interval volumes are becoming increasingly important as the gap between volume data sizes and processing speed continu...