1668 search results - page 103 / 334 » Two Philosophical Applications of Algorithmic Information Th... |
121
click to vote
CIKM
2009
Springer
15 years 11 months ago
2009
Springer
Almost every application of spreading activation is accompanied by its own set of often heuristic restrictions on the dynamics. We show that in constraint-free scenarios spreading...
123
click to vote
ICIP
2007
IEEE
15 years 10 months ago
2007
IEEE
This paper develops a classification algorithm in the framework of spectral graph theory where the underlying manifold of a high dimensional data set is described by a graph. The...
148
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
The canonical problem of solving a system of linear equations arises in numerous contexts in information theory, communication theory, and related fields. In this contribution, we ...
148
click to vote
KDD
2010
ACM
15 years 2 months ago
2010
ACM
Assume a network (V, E) where a subset of the nodes in V are active. We consider the problem of selecting a set of k active nodes that best explain the observed activation state, ...
172
click to vote
PODC
2006
ACM
15 years 10 months ago
2006
ACM
Byzantine agreement algorithms typically assume implicit initial state consistency and synchronization among the correct nodes and then operate in coordinated rounds of informatio...