17366 search results - page 238 / 3474 » New Revision Algorithms |
150
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
The maximum-likelihood decoding problem is known to be NP-hard for general linear and Reed-Solomon codes [1, 4]. In this paper, we introduce the notion of A-covered codes, that is...
163
Voted
CGF
2004
15 years 5 months ago
2004
The navigation activity is an every day practice for any human being capable of locomotion. Our objective in this work is to reproduce this crucial human activity inside virtual e...
158
click to vote
IPL
2002
15 years 5 months ago
2002
Given a planar point set, we wish to label the points with uniform circular labels such that each input point lies on the boundary of two labels, none of the interiors of the labe...
139
click to vote
ISBI
2008
IEEE
16 years 6 months ago
2008
IEEE
The emerging functional MRI (Magnetic Resonance Imaging), fMRI, imaging modality was developed to obtain non-invasive information regarding the neural processes behind pre-determi...
140
click to vote
COLT
2004
Springer
15 years 9 months ago
2004
Springer
For hyper-rectangles in Rd Auer et al. [1] proved a PAC bound of O 1 (d + log 1 ) , where and are the accuracy and confidence parameters. It is still an open question whether one...