Sciweavers

2944 search results - page 565 / 589
» Improving Bound Propagation
Sort
View
SPAA
2005
ACM
14 years 3 months ago
Value-maximizing deadline scheduling and its application to animation rendering
We describe a new class of utility-maximization scheduling problem with precedence constraints, the disconnected staged scheduling problem (DSSP). DSSP is a nonpreemptive multipro...
Eric Anderson, Dirk Beyer 0002, Kamalika Chaudhuri...
APPROX
2005
Springer
103views Algorithms» more  APPROX 2005»
14 years 3 months ago
Where's the Winner? Max-Finding and Sorting with Metric Costs
Traditionally, a fundamental assumption in evaluating the performance of algorithms for sorting and selection has been that comparing any two elements costs one unit (of time, work...
Anupam Gupta, Amit Kumar
COMPGEOM
2004
ACM
14 years 3 months ago
A 2D kinetic triangulation with near-quadratic topological changes
Given a set of n points S in the plane, a triangulation of S is a subdivision of the convex hull into triangles whose vertices are from S. In the kinetic setting, the input point ...
Pankaj K. Agarwal, Yusu Wang, Hai Yu
SAC
2004
ACM
14 years 3 months ago
Dynamic on-demand updating of data in real-time database systems
The amount of data handled by real-time and embedded applications is increasing. Also, applications normally have constraints with respect to freshness and timeliness of the data ...
Thomas Gustafsson, Jörgen Hansson
SIGCOMM
2004
ACM
14 years 3 months ago
An algebraic approach to practical and scalable overlay network monitoring
Overlay network monitoring enables distributed Internet applications to detect and recover from path outages and periods of degraded performance within seconds. For an overlay net...
Yan Chen, David Bindel, Han Hee Song, Randy H. Kat...