Sciweavers

134 search results - page 4 / 27
» A New Tight Upper Bound on the Transposition Distance
Sort
View
55
Voted
TIT
2008
84views more  TIT 2008»
14 years 9 months ago
Bounds for Codes in Products of Spaces, Grassmann, and Stiefel Manifolds
Upper bounds are derived for codes in Stiefel and Grassmann manifolds with given minimum chordal distance. They stem from upper bounds for codes in the product of unit spheres and...
Christine Bachoc, Yael Ben-Haim, Simon Litsyn
AAECC
2006
Springer
79views Algorithms» more  AAECC 2006»
15 years 3 months ago
New Bounds on the Capacity of Multi-dimensional RLL-Constrained Systems
Abstract. We examine the well-known problem of determining the capacity of multi-dimensional run-length-limited constrained systems. By recasting the problem, which is essentially ...
Moshe Schwartz, Alexander Vardy
CORR
2010
Springer
94views Education» more  CORR 2010»
14 years 9 months ago
Tight Sample Complexity of Large-Margin Learning
We obtain a tight distribution-specific characterization of the sample complexity of large-margin classification with L2 regularization: We introduce the -adapted-dimension, which...
Sivan Sabato, Nathan Srebro, Naftali Tishby
RECOMB
2007
Springer
15 years 10 months ago
Multi-break Rearrangements: From Circular to Linear Genomes
Multi-break rearrangements break a genome into multiple fragments and further glue them together in a new order. While 2break rearrangements represent standard reversals, fusions, ...
Max A. Alekseyev
JCB
2008
144views more  JCB 2008»
14 years 9 months ago
Multi-Break Rearrangements and Breakpoint Re-Uses: From Circular to Linear Genomes
Multi-break rearrangements break a genome into multiple fragments and further glue them together in a new order. While 2-break rearrangements represent standard reversals, fusions...
Max A. Alekseyev