Sciweavers

5169 search results - page 152 / 1034
» Locality approximation using time
Sort
View
ICC
2007
IEEE
216views Communications» more  ICC 2007»
15 years 11 months ago
Window-Based and Rate-Based Congestion Controls: a Local Stability Analysis under Variable RTT Conditions and the Proposal of an
— This paper mathematically frames the relation between window-based and rate-based congestion control algorithms, when the assumption of variable round-trip time conditions is i...
Michele Borri, Adriano Ferrarini, Maria Luisa Mera...
ICPR
2008
IEEE
15 years 11 months ago
Constrained piecewise linear approximation of digital curves
We have considered a problem of continuous piecewise linear approximation of the digital curves with a minimum number of the line segments. Fast suboptimal algorithm for constrain...
Alexander Kolesnikov
149
Voted
COMPGEOM
1993
ACM
15 years 9 months ago
Approximating Center Points with Iterated Radon Points
We give a practical and provably good Monte Carlo algorithm for approximating center points. Let P be a set of n points in IRd . A point c ∈ IRd is a β-center point of P if eve...
Kenneth L. Clarkson, David Eppstein, Gary L. Mille...
ICASSP
2009
IEEE
15 years 11 months ago
On the role of localization cues in binaural segregation of reverberant speech
Approaches to binaural and stereo speech segregation have often assumed that localization information can be used as a primary cue to achieve segregation of a target signal. Resul...
John Woodruff, DeLiang Wang
STOC
2010
ACM
186views Algorithms» more  STOC 2010»
15 years 9 months ago
Faster approximation schemes for fractional multicommodity flow problems via dynamic graph algorithms
We combine the work of Garg and K¨onemann, and Fleischer with ideas from dynamic graph algorithms to obtain faster (1 − ε)-approximation schemes for various versions of the mu...
Aleksander Madry