Sciweavers

412 search results - page 80 / 83
» Algorithmic Complexity Bounds on Future Prediction Errors
Sort
View
VTC
2008
IEEE
142views Communications» more  VTC 2008»
15 years 3 months ago
EXIT-Chart Aided Hybrid Multiuser Detector Design for Frequency-Domain-Spread Chip-Interleaved MC-CDMA
— With the advent of EXtrinsic Information Transfer (EXIT) charts, we are capable of analyzing, predicting and visually comparing the convergence behaviours of different turbo Mu...
Lei Xu, Rong Zhang, Sheng Chen, Lajos Hanzo
RECOMB
2005
Springer
15 years 9 months ago
Reconstruction of Reticulate Networks from Gene Trees
Abstract. One of the simplest evolutionary models has molecular sequences evolving from a common ancestor down a bifurcating phylogenetic tree, experiencing point-mutations along t...
Daniel H. Huson, Tobias H. Klöpper, Pete J. L...
IJHPCA
2008
131views more  IJHPCA 2008»
14 years 9 months ago
De Novo Ultrascale Atomistic Simulations On High-End Parallel Supercomputers
We present a de novo hierarchical simulation framework for first-principles based predictive simulations of materials and their validation on high-end parallel supercomputers and ...
Aiichiro Nakano, Rajiv K. Kalia, Ken-ichi Nomura, ...
POPL
1989
ACM
15 years 1 months ago
How to Make ad-hoc Polymorphism Less ad-hoc
raction that a programming language provides influences the structure and algorithmic complexity of the resulting programs: just imagine creating an artificial intelligence engine ...
Philip Wadler, Stephen Blott
ATAL
2011
Springer
13 years 9 months ago
Towards a unifying characterization for quantifying weak coupling in dec-POMDPs
Researchers in the field of multiagent sequential decision making have commonly used the terms “weakly-coupled” and “loosely-coupled” to qualitatively classify problems i...
Stefan J. Witwicki, Edmund H. Durfee