1668 search results - page 50 / 334 » Two Philosophical Applications of Algorithmic Information Th... |
127
click to vote
CCCG
2010
15 years 6 months ago
2010
Extending a bijection recently introduced by Poulalhon and Schaeffer [15] for triangulations of the sphere we design an efficient algorithm for encoding (topological) triangulatio...
109
click to vote
SIGECOM
2009
ACM
15 years 11 months ago
2009
ACM
We consider models for bargaining in social networks, in which players are represented by vertices and edges represent bilateral opportunities for deals between pairs of players. ...
149
click to vote
CASC
2006
Springer
15 years 8 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...
146
Voted
KDD
2010
ACM
15 years 6 months ago
2010
ACM
This paper introduces mass estimation—a base modelling mechanism in data mining. It provides the theoretical basis of mass and an efficient method to estimate mass. We show that...
135
Voted
SPIRE
2005
Springer
15 years 10 months ago
2005
Springer
We consider the problem of finding pairs of short patterns such that, in a given input sequence of length n, the distance between each pair’s patterns is at least α. The proble...