Sciweavers

4372 search results - page 158 / 875
» Algorithmic Theories of Everything
Sort
View
CASC
2006
Springer
100views Mathematics» more  CASC 2006»
15 years 7 months ago
Reducing Computational Costs in the Basic Perturbation Lemma
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...
Ainhoa Berciano, María José Jim&eacu...
COCO
1995
Springer
113views Algorithms» more  COCO 1995»
15 years 7 months ago
On the Structure of Low Sets
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...
Johannes Köbler
C3S2E
2008
ACM
15 years 5 months ago
Evenness preserving operations on musical rhythms
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,...
Francisco Gomez-Martin, Perouz Taslakian, Godfried...
127
Voted
ICASSP
2010
IEEE
15 years 4 months ago
Optimized intrinsic dimension estimator using nearest neighbor graphs
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...
Kumar Sricharan, Raviv Raich, Alfred O. Hero III
120
Voted
AAECC
2006
Springer
109views Algorithms» more  AAECC 2006»
15 years 3 months ago
Cryptosystems using Linear Groups
Several suggestions are presented for developing cryptosystems, both classical and public key, using a combination of combinatorial group theory and linear groups. In particular, t...
Gilbert Baumslag, Benjamin Fine, Xiaowei Xu