4403 search results - page 160 / 881 » Galois Theory of Algorithms |
141
click to vote
CSR
2007
Springer
15 years 10 months ago
2007
Springer
We study the empirical meaning of randomness with respect to a family of probability distributions P, where is a real parameter, using algorithmic randomness theory. In the case w...
175
click to vote
CASC
2006
Springer
15 years 10 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...
165
click to vote
COCO
1995
Springer
15 years 10 months ago
1995
Springer
Over a decade ago, Schoning introduced the concept of lowness into structural complexity theory. Since then a large body of results has been obtained classifying various complexit...
148
click to vote
C3S2E
2008
ACM
15 years 8 months ago
2008
ACM
In this paper we define four operations on musical rhythms that preserve a property called maximal evenness. The operations we describe are shadow, complementation, concatenation,...
168
click to vote
ICASSP
2010
IEEE
15 years 6 months ago
2010
IEEE
We develop an approach to intrinsic dimension estimation based on k-nearest neighbor (kNN) distances. The dimension estimator is derived using a general theory on functionals of k...