Sciweavers

539 search results - page 76 / 108
» Recurrence relations and fast algorithms
Sort
View
139
Voted
CODCRY
2011
Springer
242views Cryptology» more  CODCRY 2011»
14 years 4 months ago
Faster 2-Regular Information-Set Decoding
Fix positive integers B and w. Let C be a linear code over F2 of length Bw. The 2-regular-decoding problem is to find a nonzero codeword consisting of w length-B blocks, each of w...
Daniel J. Bernstein, Tanja Lange, Christiane Peter...
102
Voted
ATAL
2009
Springer
15 years 7 months ago
Generalized model learning for reinforcement learning in factored domains
Improving the sample efficiency of reinforcement learning algorithms to scale up to larger and more realistic domains is a current research challenge in machine learning. Model-ba...
Todd Hester, Peter Stone
99
Voted
ICML
2007
IEEE
16 years 1 months ago
Information-theoretic metric learning
In this paper, we present an information-theoretic approach to learning a Mahalanobis distance function. We formulate the problem as that of minimizing the differential relative e...
Jason V. Davis, Brian Kulis, Prateek Jain, Suvrit ...
112
Voted
EWSN
2007
Springer
16 years 4 days ago
An Energy-Efficient K-Hop Clustering Framework for Wireless Sensor Networks
Many applications in wireless sensor networks (WSNs) benefit significantly from organizing nodes into groups, called clusters, because data aggregation and data filtering applied i...
Quanbin Chen, Jian Ma, Yanmin Zhu, Dian Zhang, Lio...
113
Voted
ISBI
2009
IEEE
15 years 7 months ago
LV Surface Reconstruction from Sparse TMRI Using Laplacian Surface Deformation and Optimization
We propose a novel framework to reconstruct the left ventricle (LV)’s 3D surface from sparse tagged-MRI (tMRI). First we acquire an initial surface mesh from a dense tMRI. Then ...
Shaoting Zhang, Xiaoxu Wang, Dimitris Metaxas, Tin...