2588 search results - page 31 / 518 » Applications of Kolmogorov complexity to computable model th... |
103
click to vote
CASC
2006
Springer
15 years 3 months ago
2006
Springer
Homological Perturbation Theory [11, 13] is a well-known general method for computing homology, but its main algorithm, the Basic Perturbation Lemma, presents, in general, high com...
101
click to vote
DNA
2007
Springer
15 years 5 months ago
2007
Springer
While algorithmic DNA self-assembly is, in theory, capable of forming complex patterns, its experimental demonstration has been limited by significant assembly errors. In this pa...
ICIP
2003
IEEE
16 years 25 days ago
2003
IEEE
Although, computational Grid has been initially developed to solve large-scale scientific research problems, it is extended for commercial and industrial applications. An interest...
SIGECOM
2005
ACM
15 years 4 months ago
2005
ACM
We determine the communication complexity of the common voting rules. The rules (sorted by their communication complexity from low to high) are plurality, plurality with runoff, ...
118
click to vote
CHI
2011
ACM
14 years 2 months ago
2011
ACM
The study of creativity has received significant attention over the past century, with a recent increase in interest in collaborative, distributed creativity. We posit that creati...