Sciweavers

118 search results - page 17 / 24
» soda 2008
Sort
View
SODA
2008
ACM
140views Algorithms» more  SODA 2008»
14 years 11 months ago
Minimizing average latency in oblivious routing
We consider the problem of minimizing average latency cost while obliviously routing traffic in a network with linear latency functions. This is roughly equivalent to minimizing t...
Prahladh Harsha, Thomas P. Hayes, Hariharan Naraya...
SODA
2008
ACM
108views Algorithms» more  SODA 2008»
14 years 11 months ago
Dimension augmentation and combinatorial criteria for efficient error-resistant DNA self-assembly
DNA self-assembly has emerged as a rich and promising primitive for nano-technology. Experimental and analytical evidence indicates that such systems are prone to errors, and acco...
Ho-Lin Chen, Ashish Goel, Chris Luhrs
84
Voted
SODA
2008
ACM
128views Algorithms» more  SODA 2008»
14 years 11 months ago
Analysis of greedy approximations with nonsubmodular potential functions
In this paper, we present two techniques to analyze greedy approximation with nonsubmodular functions restricted submodularity and shifted submodularity. As an application of the ...
Ding-Zhu Du, Ronald L. Graham, Panos M. Pardalos, ...
SODA
2008
ACM
80views Algorithms» more  SODA 2008»
14 years 11 months ago
Provably good multicore cache performance for divide-and-conquer algorithms
This paper presents a multicore-cache model that reflects the reality that multicore processors have both per-processor private (L1) caches and a large shared (L2) cache on chip. ...
Guy E. Blelloch, Rezaul Alam Chowdhury, Phillip B....
72
Voted
SODA
2010
ACM
175views Algorithms» more  SODA 2010»
15 years 7 months ago
Optimally Reconstructing Weighted Graphs Using Queries
d Abstract) Hanna Mazzawi Technion - Israel Institute of Technology In this paper, we consider the problem of reconstructing a hidden graph with m edges using additive queries. Gi...
Hanna Mazzawi