Sciweavers

4860 search results - page 147 / 972
» SNPs Problems, Complexity, and Algorithms
Sort
View
ALT
2011
Springer
12 years 10 months ago
On Noise-Tolerant Learning of Sparse Parities and Related Problems
We consider the problem of learning sparse parities in the presence of noise. For learning parities on r out of n variables, we give an algorithm that runs in time poly log 1 δ , ...
Elena Grigorescu, Lev Reyzin, Santosh Vempala
ISCAS
2006
IEEE
147views Hardware» more  ISCAS 2006»
14 years 4 months ago
Triangular systolic array with reduced latency for QR-decomposition of complex matrices
- The novel CORDIC-based architecture of the these weights (combiner unit). The implementation of the Triangular Systolic Array for QRD of large size complex combiner unit is rathe...
Alexander Maltsev, V. Pestretsov, Roman Maslenniko...
AIIA
2007
Springer
14 years 4 months ago
Evolving Complex Neural Networks
Abstract. Complex networks like the scale-free model proposed by BarabasiAlbert are observed in many biological systems and the application of this topology to artificial neural ne...
Mauro Annunziato, Ilaria Bertini, Matteo De Felice...
ATAL
2006
Springer
14 years 1 months ago
Junta distributions and the average-case complexity of manipulating elections
Encouraging voters to truthfully reveal their preferences in an election has long been an important issue. Previous studies have shown that some voting protocols are hard to manip...
Ariel D. Procaccia, Jeffrey S. Rosenschein
POPL
2008
ACM
14 years 10 months ago
Lightweight semiformal time complexity analysis for purely functional data structures
Okasaki and others have demonstrated how purely functional data structures that are efficient even in the presence of persistence can be constructed. To achieve good time bounds e...
Nils Anders Danielsson