Sciweavers

74 search results - page 12 / 15
» The Lower Tail of the Random Minimum Spanning Tree
Sort
View
FOCS
2007
IEEE
14 years 1 months ago
On the Hardness and Smoothed Complexity of Quasi-Concave Minimization
In this paper, we resolve the smoothed and approximative complexity of low-rank quasi-concave minimization, providing both upper and lower bounds. As an upper bound, we provide th...
Jonathan A. Kelner, Evdokia Nikolova
ICCAD
2009
IEEE
87views Hardware» more  ICCAD 2009»
13 years 5 months ago
Mitigation of intra-array SRAM variability using adaptive voltage architecture
SRAM cell design is driven by the need to satisfy static noise margin, write margin and read current margin (RCM) over all cells in the array in an energy-efficient manner. These ...
Ashish Kumar Singh, Ku He, Constantine Caramanis, ...
WADS
2009
Springer
226views Algorithms» more  WADS 2009»
14 years 2 months ago
Online Priority Steiner Tree Problems
Abstract. A central issue in the design of modern communication networks is the provision of Quality-of-Service (QoS) guarantees at the presence of heterogeneous users. For instanc...
Spyros Angelopoulos
LCN
2006
IEEE
14 years 1 months ago
Computing Real Time Jobs in P2P Networks
— In this paper, we present a distributed computing framework designed to support higher quality of service and fault tolerance for processing deadline-driven tasks in a P2P envi...
Jingnan Yao, Jian Zhou, Laxmi N. Bhuyan
ICALP
2009
Springer
14 years 7 months ago
Limits and Applications of Group Algebras for Parameterized Problems
The algebraic framework introduced in [Koutis, Proc. of the 35th ICALP 2008] reduces several combinatorial problems in parameterized complexity to the problem of detecting multili...
Ioannis Koutis, Ryan Williams