Sciweavers

312 search results - page 26 / 63
» Degree Bounded Network Design with Metric Costs
Sort
View
MOR
2007
149views more  MOR 2007»
13 years 8 months ago
LP Rounding Approximation Algorithms for Stochastic Network Design
Real-world networks often need to be designed under uncertainty, with only partial information and predictions of demand available at the outset of the design process. The field ...
Anupam Gupta, R. Ravi, Amitabh Sinha
FOCS
2000
IEEE
14 years 1 months ago
Hierarchical Placement and Network Design Problems
In this paper, we give the first constant-approximations for a number of layered network design problems. We begin by modeling hierarchical caching, where caches are placed in la...
Sudipto Guha, Adam Meyerson, Kamesh Munagala
PDPTA
2004
13 years 10 months ago
Design of a Real-Time Scheduler for Kahn Process Networks on Multiprocessor Systems
High-throughput real-time systems require non-standard and costly hardware and software solutions. Modern workstation can represent a credible alternative to develop realtime inte...
Javed Dulloo, Philippe Marquet
ACMSE
2005
ACM
14 years 2 months ago
Using nonlinear dimensionality reduction in 3D figure animation
This paper explores a method for re-sequencing an existing set of animation, specifically motion capture data, to generate new motion. Re-using animation is helpful in designing ...
A. Elizabeth Seward, Bobby Bodenheimer
BNCOD
2004
184views Database» more  BNCOD 2004»
13 years 10 months ago
Bulk Loading the M-Tree to Enhance Query Performance
The M-tree is a paged, dynamically balanced metric access method that responds gracefully to the insertion of new objects. Like many spatial access methods, the M-tree's perfo...
Alan P. Sexton, Richard Swinbank