Sciweavers

4342 search results - page 179 / 869
» Improved Algorithms for Optimal Embeddings
Sort
View
STOC
2003
ACM
130views Algorithms» more  STOC 2003»
16 years 5 months ago
A tight bound on approximating arbitrary metrics by tree metrics
In this paper, we show that any n point metric space can be embedded into a distribution over dominating tree metrics such that the expected stretch of any edge is O(log n). This ...
Jittat Fakcharoenphol, Satish Rao, Kunal Talwar
CODES
2009
IEEE
15 years 5 months ago
Efficient dynamic voltage/frequency scaling through algorithmic loop transformation
We present a novel loop transformation technique, particularly well suited for optimizing embedded compilers, where an increase in compilation time is acceptable in exchange for s...
Mohammad Ali Ghodrat, Tony Givargis
APPROX
2008
Springer
100views Algorithms» more  APPROX 2008»
15 years 6 months ago
Optimal Random Matchings on Trees and Applications
In this paper we will consider tight upper- and lower-bounds on the weight of the optimal matching for random point sets distributed among the leaves of a tree, as a function of it...
Jeff Abrahamson, Béla Csaba, Ali Shokoufand...
GLOBECOM
2007
IEEE
15 years 11 months ago
Joint Computation and Communication Scheduling to Enable Rich Mobile Applications
Abstract—Increasing interest in sensor networking and ubiquitous computing has created a trend towards embedding more and more intelligence into our surroundings. This enables th...
Shoubhik Mukhopadhyay, Curt Schurgers, Sujit Dey
FOCS
2006
IEEE
15 years 10 months ago
Improved Bounds for Online Routing and Packing Via a Primal-Dual Approach
In this work we study a wide range of online and offline routing and packing problems with various objectives. We provide a unified approach, based on a clean primal-dual method...
Niv Buchbinder, Joseph Naor