Sciweavers

4372 search results - page 537 / 875
» Algorithmic Theories of Everything
Sort
View
JCB
2007
168views more  JCB 2007»
15 years 6 months ago
Fast Molecular Shape Matching Using Contact Maps
In this paper, we study the problem of computing the similarity of two protein structures ring their contact-map overlap. Contact-map overlap abstracts the problem of computing th...
Pankaj K. Agarwal, Nabil H. Mustafa, Yusu Wang
TSP
2008
166views more  TSP 2008»
15 years 6 months ago
Nonuniform Sampling of Periodic Bandlimited Signals
Abstract--Digital processing techniques are based on representing a continuous-time signal by a discrete set of samples. This paper treats the problem of reconstructing a periodic ...
E. Margolis, Yonina C. Eldar
AI
2002
Springer
15 years 6 months ago
Learning Bayesian networks from data: An information-theory based approach
This paper provides algorithms that use an information-theoretic analysis to learn Bayesian network structures from data. Based on our three-phase learning framework, we develop e...
Jie Cheng, Russell Greiner, Jonathan Kelly, David ...
CORR
2004
Springer
119views Education» more  CORR 2004»
15 years 6 months ago
The Largest Compatible Subset Problem for Phylogenetic Data
Abstract. The phylogenetic tree construction is to infer the evolutionary relationship between species from the experimental data. However, the experimental data are often imperfec...
Andy Auyeung, Ajith Abraham
CORR
2004
Springer
90views Education» more  CORR 2004»
15 years 6 months ago
Non-computable Julia sets
While most polynomial Julia sets are computable, it has been recently shown [12] that there exist non-computable Julia sets. The proof was non-constructive, and indeed there were ...
Mark Braverman, Michael Yampolsky