Sciweavers

5580 search results - page 617 / 1116
» Randomized priority algorithms
Sort
View
AAECC
2005
Springer
131views Algorithms» more  AAECC 2005»
15 years 4 months ago
Noisy interpolation of sparse polynomials in finite fields
Abstract We consider a polynomial analogue of the hidden number problem introduced by Boneh andVenkatesan, namely the sparse polynomial noisy interpolation problem of recovering an...
Igor Shparlinski, Arne Winterhof
TIT
2008
83views more  TIT 2008»
15 years 4 months ago
Hard Problems of Algebraic Geometry Codes
The minimum distance is one of the most important combinatorial characterizations of a code. The maximum likelihood decoding problem is one of the most important algorithmic proble...
Qi Cheng
JAL
2002
69views more  JAL 2002»
15 years 4 months ago
Rates of convergence for Quicksort
The normalized number of key comparisons needed to sort a list of randomly permuted items by the Quicksort algorithm is known to converge in distribution. We identify the rate of ...
Ralph Neininger, Ludger Rüschendorf
126
Voted
IVC
1998
65views more  IVC 1998»
15 years 4 months ago
Segmentation of MR images with intensity inhomogeneities
A statistical model to segment clinical magnetic resonance (MR) images in the presence of noise and intensity inhomogeneities is proposed. Inhomogeneities are considered to be mul...
Jagath C. Rajapakse, Frithjof Kruggel
TIT
2002
75views more  TIT 2002»
15 years 4 months ago
Iterative multiuser joint decoding: Unified framework and asymptotic analysis
We present a framework for iterative multiuser joint decoding of code-division multiple-access (CDMA) signals, based on the factor-graph representation and on the sum-product algor...
Joseph Boutros, Giuseppe Caire