Sciweavers

20294 search results - page 117 / 4059
» Algorithmic Information Theory
Sort
View
CIKM
2009
Springer
15 years 11 months ago
Pure spreading activation is pointless
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...
Michael R. Berthold, Ulrik Brandes, Tobias Kö...
ICCS
2009
Springer
15 years 11 months ago
System Consequence
My paper discusses system consequence, which is a central idea in the project to lift the theory of information flow to the general level of universal logic and the theory of ins...
Robert E. Kent
ICIP
2005
IEEE
16 years 6 months ago
Largest-eigenvalue-theory for incremental principal component analysis
In this paper, we present a novel algorithm for incremental principal component analysis. Based on the LargestEigenvalue-Theory, i.e. the eigenvector associated with the largest ei...
Shuicheng Yan, Xiaoou Tang
DIALM
2004
ACM
100views Algorithms» more  DIALM 2004»
15 years 9 months ago
Virtual coordinates for ad hoc and sensor networks
In many applications of wireless ad hoc and sensor networks, position-awareness is of great importance. Often, as in the case of geometric routing, it is sufficient to have virtua...
Thomas Moscibroda, Regina O'Dell, Mirjam Wattenhof...
TACAS
2009
Springer
99views Algorithms» more  TACAS 2009»
15 years 11 months ago
Ground Interpolation for the Theory of Equality
Abstract. Given a theory T and two formulas A and B jointly unsatisfiable in T , a theory interpolant of A and B is a formula I such that (i) its non-theory symbols are shared by ...
Alexander Fuchs, Amit Goel, Jim Grundy, Sava Krsti...