1918 search results - page 117 / 384 » Discovering Cortical Algorithms |
IPL
2002
14 years 9 months ago
2002
An algorithm, described by Sedgewick, finds the distance between the closest pair of n given points in a plane using a variant of mergesort. This takes O(n log n) time. To prove t...
107
click to vote
KDD
2007
ACM
15 years 10 months ago
2007
ACM
Frequent episode discovery is a popular framework for mining data available as a long sequence of events. An episode is essentially a short ordered sequence of event types and the...
BMCBI
2008
14 years 10 months ago
2008
Background: Understanding how proteins fold is essential to our quest in discovering how life works at the molecular level. Current computation power enables researchers to produc...
JSA
2006
14 years 10 months ago
2006
ct 7 Social animals or insects in nature often exhibit a form of emergent collective behavior known as flocking. In this paper, 8 we present a novel Flocking based approach for doc...
JMLR
2010
14 years 4 months ago
2010
We present two Bayesian algorithms CD-B and CD-H for discovering unconfounded cause and effect relationships from observational data without assuming causal sufficiency which prec...