Sciweavers

17770 search results - page 3510 / 3554
» A Generalization of Forward-Backward Algorithm
Sort
View
CORR
2010
Springer
135views Education» more  CORR 2010»
14 years 9 months ago
Information Distance
While Kolmogorov complexity is the accepted absolute measure of information content in an individual finite object, a similarly absolute notion is needed for the information distan...
Charles H. Bennett, Péter Gács, Ming...
CORR
2010
Springer
95views Education» more  CORR 2010»
14 years 9 months ago
Performance evaluation for ML sequence detection in ISI channels with Gauss Markov Noise
Inter-symbol interference (ISI) channels with data dependent Gauss Markov noise have been used to model read channels in magnetic recording and other data storage systems. The Vite...
Naveen Kumar, Aditya Ramamoorthy, Murti V. Salapak...
CORR
2010
Springer
92views Education» more  CORR 2010»
14 years 9 months ago
Parameterizing by the Number of Numbers
The usefulness of parameterized algorithmics has often depended on what Niedermeier has called, "the art of problem parameterization." In this paper we introduce and expl...
Michael R. Fellows, Serge Gaspers, Frances A. Rosa...
CORR
2010
Springer
164views Education» more  CORR 2010»
14 years 9 months ago
Schnyder decompositions for regular plane graphs and application to drawing
Schnyder woods are decompositions of simple triangulations into three edge-disjoint spanning trees crossing each other in a specific way. In this article, we define a generalizatio...
Olivier Bernardi, Éric Fusy
CORR
2008
Springer
97views Education» more  CORR 2008»
14 years 9 months ago
Lower bounds for adaptive linearity tests
Linearity tests are randomized algorithms which have oracle access to the truth table of some function f, and are supposed to distinguish between linear functions and functions whi...
Shachar Lovett
« Prev « First page 3510 / 3554 Last » Next »