Sciweavers

1449 search results - page 199 / 290
» Self-Randomized Exponentiation Algorithms
Sort
View
FOCS
2006
IEEE
16 years 8 days ago
On the Optimality of the Dimensionality Reduction Method
We investigate the optimality of (1+ )-approximation algorithms obtained via the dimensionality reduction method. We show that: • Any data structure for the (1 + )-approximate n...
Alexandr Andoni, Piotr Indyk, Mihai Patrascu
ASPDAC
2006
ACM
130views Hardware» more  ASPDAC 2006»
16 years 5 days ago
Convergence-provable statistical timing analysis with level-sensitive latches and feedback loops
Statistical timing analysis has been widely applied to predict the timing yield of VLSI circuits when process variations become significant. Existing statistical latch timing met...
Lizheng Zhang, Jeng-Liang Tsai, Weijen Chen, Yuhen...
AINA
2005
IEEE
15 years 12 months ago
Improving the Ramping up Behavior of TCP Slow Start
This paper proposes an improvement to the TCP ramp up behavior in slow-start. Current implementations of the TCP start-up procedure may result in an exponential growth of the cong...
Rung-Shiang Cheng, Hui-Tang Lin, Wen-Shyang Hwang,...
EPEW
2005
Springer
15 years 11 months ago
PiDuce: A Process Calculus with Native XML Datatypes
We develop the static and dynamic semantics of PiDuce, a process calculus with XML values, schemas, and pattern matching. PiDuce values include channel names, therefore the structu...
Allen L. Brown Jr., Cosimo Laneve, L. Gregory Mere...
STACS
2005
Springer
15 years 11 months ago
Worst-Case and Average-Case Approximations by Simple Randomized Search Heuristics
Abstract. In recent years, probabilistic analyses of algorithms have received increasing attention. Despite results on the average-case complexity and smoothed complexity of exact ...
Carsten Witt