2588 search results - page 508 / 518 » Applications of Kolmogorov complexity to computable model th... |
105
click to vote
IJCAI
1989
15 years 10 days ago
1989
gn problem can be abstractly characterized as a constrained function-to-structure mapping. The de sign task takes as input the specifications of the desired functions of a device...
101
click to vote
SMA
2010
ACM
14 years 11 months ago
2010
ACM
We present a novel method for fast retrieval of exact Minkowski sums of pairs of convex polytopes in R3 , where one of the polytopes keeps rotating. The algorithm is based on pre-...
BMCBI
2007
14 years 11 months ago
2007
Background: Systematic, high-throughput studies of mouse phenotypes have been hampered by the inability to analyze individual animal data from a multitude of sources in an integra...
111
click to vote
CSL
2006
Springer
14 years 11 months ago
2006
Springer
Support vector machines (SVMs) have proven to be a powerful technique for pattern classification. SVMs map inputs into a high dimensional space and then separate classes with a hy...
101
click to vote
CORR
2004
Springer
14 years 11 months ago
2004
Springer
Social insect societies and more specifically ant colonies, are distributed systems that, in spite of the simplicity of their individuals, present a highly structured social organi...