Sciweavers

20294 search results - page 288 / 4059
» Algorithmic Information Theory
Sort
View
152
Voted
CORR
2008
Springer
104views Education» more  CORR 2008»
15 years 8 months ago
A General Notion of Useful Information
In this paper we introduce a general framework for defining the depth of a sequence with respect to a class of observers. We show that our general framework captures all depth not...
Philippe Moser
NAACL
2004
15 years 8 months ago
Accurate Information Extraction from Research Papers using Conditional Random Fields
With the increasing use of research paper search engines, such as CiteSeer, for both literature search and hiring decisions, the accuracy of such systems is of paramount importanc...
Fuchun Peng, Andrew McCallum
INTR
2007
98views more  INTR 2007»
15 years 6 months ago
User-centered evaluation of information: a research challenge
Purpose – This paper sets out to present the concept of the value of information, review the descriptive, rational, social and behavioral approaches for assessing the value of i...
Daphne R. Raban
IFIP
2004
Springer
16 years 2 days ago
Asymptotic Behaviors of Type-2 Algorithms and Induced Baire Topologies
Abstract We propose an alternative notion of asymptotic behaviors for the study of type2 computational complexity. Since the classical asymptotic notion (for all but finitely many...
Chung-Chih Li
RSA
2002
99views more  RSA 2002»
15 years 6 months ago
Distributed algorithms with dynamical random transitions
Given any measure-preserving dynamical system (Y, A , , T) and g Lp() , we study convergence of the sequence 1 n n k=1 g TSk , n 1 where Sk is a dynamic Zr -valued random w...
Nadine Guillotin-Plantard, René Schott