Sciweavers

20294 search results - page 96 / 4059
» Algorithmic Information Theory
Sort
View
WADS
2005
Springer
133views Algorithms» more  WADS 2005»
15 years 9 months ago
Heap Building Bounds
We consider the lower bound for building a heap in the worst case and the upper bound in the average case. We will prove that the supposedly fastest algorithm in the average case[2...
Zhentao Li, Bruce A. Reed
CAISE
2003
Springer
15 years 9 months ago
Recommendation Based Discovery of Dynamic Virtual Communities
Recommendation systems are becoming increasingly popular in various large-scale web-based applications (such as infomediaries, emarketplaces, knowledge portals) since they enable u...
Manos Papagelis, Dimitris Plexousakis
JIS
2008
57views more  JIS 2008»
15 years 4 months ago
Judgements during information seeking: a naturalistic approach to understanding the assessment of enough information
In this article, theories of human judgement and decision making are reviewed and their use by library and information science researchers examined. A different perspective on jud...
Jennifer M. Berryman
ALT
2003
Springer
16 years 1 months ago
On the Existence and Convergence of Computable Universal Priors
Solomonoff unified Occam’s razor and Epicurus’ principle of multiple explanations to one elegant, formal, universal theory of inductive inference, which initiated the field...
Marcus Hutter
138
Voted
KR
2004
Springer
15 years 9 months ago
Knowledge Discovery by Reversing Inductive Knowledge Representation
In a very basic sense, the aim of knowledge discovery is to reveal structures of knowledge which can be seen as being represented by structural relationships. In this paper, we ma...
Gabriele Kern-Isberner, Jens Fisseler