Sciweavers

2626 search results - page 219 / 526
» The complexity of stochastic sequences
Sort
View
PAMI
2010
161views more  PAMI 2010»
15 years 5 months ago
Nonstationary Shape Activities: Dynamic Models for Landmark Shape Change and Applications
—The goal of this work is to develop statistical models for the shape change of a configuration of “landmark” points (key points of interest) over time and to use these mode...
Samarjit Das, Namrata Vaswani
RECOMB
2005
Springer
16 years 6 months ago
A Partial Solution to the C-Value Paradox
In the half-century since the C-value paradox (the apparent lack of correlation between organismal genome size and morphological complexity) was described, there have been no expli...
Jeffrey M. Marcus
ICC
2007
IEEE
16 years 27 days ago
Widely Linear Prediction for Blind Equalization
— This paper proposes a new blind equalization scheme based on widely linear (WL) prediction. It permits to compensate non-minimum phase channels with or without spectral nulls, ...
Francisco J. A. de Aquino, Carlos A. F. da Rocha, ...
FSE
2005
Springer
98views Cryptology» more  FSE 2005»
16 years 3 days ago
New Attacks Against Reduced-Round Versions of IDEA
In this paper, we describe a sequence of simple, yet efficient chosen-plaintext (or chosen-ciphertext) attacks against reduced-round versions of IDEA (with 2, 2.5, 3, 3.5, and 4 ro...
Pascal Junod
CAV
2008
Springer
99views Hardware» more  CAV 2008»
15 years 8 months ago
Correcting a Space-Efficient Simulation Algorithm
Although there are many efficient algorithms for calculating the simulation preorder on finite Kripke structures, only two have been proposed of which the space complexity is of t...
Rob J. van Glabbeek, Bas Ploeger