103 search results - page 19 / 21 » The Arithmetical Complexity of Dimension and Randomness |
JOC
2008
13 years 9 months ago
2008
In this paper, we study an E0-like combiner with memory as the keystream generator. First, we formulate a systematic and simple method to compute correlations of the FSM output seq...
ISI
2010
Springer
13 years 8 months ago
2010
Springer
Abstract—Trust is an important yet complex and little understood dyadic relation among actors in a social network. There are many dimensions to trust; trust plays an important ro...
HISB
2011
12 years 9 months ago
2011
— This paper presents a new cellular automata-based unsupervised image segmentation technique that is motivated by the interactive grow-cut algorithm. In contrast to the traditio...
ICASSP
2010
IEEE
13 years 10 months ago
2010
IEEE
Algorithms such as Least Median of Squares (LMedS) and Random Sample Consensus (RANSAC) have been very successful for low-dimensional robust regression problems. However, the comb...
APPROX
2009
Springer
14 years 4 months ago
2009
Springer
The Nearest Codeword Problem (NCP) is a basic algorithmic question in the theory of error-correcting codes. Given a point v ∈ Fn 2 and a linear space L ⊆ Fn 2 of dimension k NC...