Sciweavers

96 search results - page 14 / 20
» Fast Exact MultiConstraint Shortest Path Algorithms
Sort
View
CCR
2000
75views more  CCR 2000»
13 years 6 months ago
The Eifel algorithm: making TCP robust against spurious retransmissions
We propose an enhancement to TCP's error recovery scheme, which we call the Eifel algorithm. It eliminates the retransmission ambiguity, thereby solving the problems caused b...
Reiner Ludwig, Randy H. Katz
MP
2002
101views more  MP 2002»
13 years 6 months ago
Componentwise fast convergence in the solution of full-rank systems of nonlinear equations
The asymptotic convergence of parameterized variants of Newton's method for the solution of nonlinear systems of equations is considered. The original system is perturbed by a...
Nicholas I. M. Gould, Dominique Orban, Annick Sart...
DAC
2004
ACM
14 years 7 months ago
Fast statistical timing analysis handling arbitrary delay correlations
CT An efficient statistical timing analysis algorithm that can handle arbitrary (spatial and structural) causes of delay correlation is described. The algorithm derives the entire ...
Michael Orshansky, Arnab Bandyopadhyay
ICDAR
2011
IEEE
12 years 6 months ago
Fast Key-Word Searching via Embedding and Active-DTW
—In this paper we present a novel approach for fast search of handwritten Arabic word-parts within large lexicons. The algorithm runs through three steps to achieve the required ...
Raid Saabni, Alex Bronstein
SODA
1992
ACM
252views Algorithms» more  SODA 1992»
13 years 7 months ago
A General Approximation Technique for Constrained Forest Problems
We present a general approximation technique for a large class of graph problems. Our technique mostly applies to problems of covering, at minimum cost, the vertices of a graph wit...
Michel X. Goemans, David P. Williamson