Sciweavers

134 search results - page 13 / 27
» A New Tight Upper Bound on the Transposition Distance
Sort
View
126
Voted
GLOBECOM
2007
IEEE
15 years 8 months ago
Performance Analysis of Orthogonal Space Time Block Coding over Hoyt Fading Channels
—In this paper, a novel error probability analysis of orthogonal space-time block coding (OSTBC) over independent but not necessarily identical Hoyt (Nakagami-q) fading channels ...
George A. Ropokis, Athanasios A. Rontogiannis, P. ...
COCO
2009
Springer
131views Algorithms» more  COCO 2009»
15 years 8 months ago
A Multi-Round Communication Lower Bound for Gap Hamming and Some Consequences
—The Gap-Hamming-Distance problem arose in the context of proving space lower bounds for a number of key problems in the data stream model. In this problem, Alice and Bob have to...
Joshua Brody, Amit Chakrabarti
107
Voted
ICPR
2000
IEEE
16 years 2 months ago
Stability Analysis of Medial Axis Transform under Relative Hausdorff Distance
Medial axis transform (MAT) is a basic tool for shape analysis. But, in spite of its usefulness, it has some drawbacks, one of which is its instability under the boundary perturba...
Sung Woo Choi, Seong-Whan Lee
126
Voted
COMPGEOM
2010
ACM
15 years 7 months ago
Incidences in three dimensions and distinct distances in the plane
d Abstract] György Elekes Eötvös University Micha Sharir Tel Aviv University and New York University We first describe a reduction from the problem of lower-bounding the numbe...
György Elekes, Micha Sharir
110
Voted
ALGORITHMICA
2005
108views more  ALGORITHMICA 2005»
15 years 1 months ago
Key-Independent Optimality
A new form of optimality for comparison based static dictionaries is introduced. This type of optimality, keyindependent optimality, is motivated by applications that assign key v...
John Iacono