Sciweavers

2623 search results - page 34 / 525
» Universal Learning Theory
Sort
View
CADE
2005
Springer
14 years 9 months ago
Connecting Many-Sorted Theories
Abstract. Basically, the connection of two many-sorted theories is obtained by taking their disjoint union, and then connecting the two parts through connection functions that must...
Franz Baader, Silvio Ghilardi
AML
2008
84views more  AML 2008»
13 years 7 months ago
Model theory of the regularity and reflection schemes
Abstract. This paper develops the model theory of ordered structures that satisfy Keisler's regularity scheme, and its strengthening REF(L) (the reflection scheme) which is an...
Ali Enayat, Shahram Mohsenipour
SODA
2000
ACM
95views Algorithms» more  SODA 2000»
13 years 10 months ago
Towards a theory of cache-efficient algorithms
We present a model that enables us to analyze the running time of an algorithm on a computer with a memory hierarchy with limited associativity, in terms of various cache parameter...
Sandeep Sen, Siddhartha Chatterjee
TREC
2004
13 years 10 months ago
Columbia University in the Novelty Track at TREC 2004
Our system for the Novelty Track at TREC 2004 looks beyond sentence boundaries as well as within sentences to identify novel, nonduplicative passages. It tries to identify text sp...
Barry Schiffman, Kathleen McKeown
ICCS
2009
Springer
14 years 3 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