Sciweavers

134 search results - page 5 / 27
» A New Tight Upper Bound on the Transposition Distance
Sort
View
ISAAC
2009
Springer
98views Algorithms» more  ISAAC 2009»
15 years 4 months ago
New Bounds on the Average Distance from the Fermat-Weber Center of a Planar Convex Body
The Fermat-Weber center of a planar body Q is a point in the plane from which the average distance to the points in Q is minimal. We first show that for any convex body Q in the ...
Adrian Dumitrescu, Csaba D. Tóth
ASPDAC
2007
ACM
92views Hardware» more  ASPDAC 2007»
15 years 1 months ago
New Block-Based Statistical Timing Analysis Approaches Without Moment Matching
With aggressive scaling down of feature sizes in VLSI fabrication, process variation has become a critical issue in designs. We show that two necessary conditions for the "Ma...
Ruiming Chen, Hai Zhou
TIT
2008
149views more  TIT 2008»
14 years 9 months ago
An Improved Bound on the List Error Probability and List Distance Properties
A new upper bound on the list error probability is presented. This bound is derived by combining the techniques for obtaining the tangential union bound with an improved bound on t...
Irina E. Bocharova, Rolf Johannesson, Boris D. Kud...
WADS
2005
Springer
111views Algorithms» more  WADS 2005»
15 years 3 months ago
On Geometric Dilation and Halving Chords
Let G be an embedded planar graph whose edges may be curves. The detour between two points, p and q (on edges or vertices) of G, is the ratio between the shortest path in G between...
Adrian Dumitrescu, Annette Ebbers-Baumann, Ansgar ...
APPROX
2006
Springer
130views Algorithms» more  APPROX 2006»
15 years 1 months ago
Robust Mixing
In this paper, we develop a new "robust mixing" framework for reasoning about adversarially modified Markov Chains (AMMC). Let P be the transition matrix of an irreducib...
Murali K. Ganapathy