Sciweavers

7840 search results - page 264 / 1568
» On generalized Ramsey numbers
Sort
View
AAAI
2000
15 years 8 months ago
The Complexity of Restricted Consequence Finding and Abduction
We analyze the complexity of propositional kernel resolution (del Val 1999), a general method for obtaining logical consequences in restricted target languages. Different choices ...
Alvaro del Val
TREC
2003
15 years 8 months ago
Relevance Propagation for Topic Distillation UIUC TREC 2003 Web Track Experiments
In this paper, we report our experiments on the Web Track TREC-2003. We submitted five runs for the topic distillation task. Our goal was to evaluate the standard language modeli...
Azadeh Shakery, ChengXiang Zhai
SODA
2000
ACM
85views Algorithms» more  SODA 2000»
15 years 8 months ago
Improved bounds on the sample complexity of learning
We present a new general upper bound on the number of examples required to estimate all of the expectations of a set of random variables uniformly well. The quality of the estimat...
Yi Li, Philip M. Long, Aravind Srinivasan
CCCG
2009
15 years 7 months ago
Clarkson's Algorithm for Violator Spaces
Clarkson's algorithm is a two-staged randomized algorithm for solving linear programs, but it can also be applied to the more general LP-type problems which comprise a number...
Yves Brise, Bernd Gärtner
ACTA
2010
81views more  ACTA 2010»
15 years 6 months ago
Lifting non-finite axiomatizability results to extensions of process algebras
Abstract This paper presents a general technique for obtaining new results pertaining to the non-finite axiomatizability of behavioral semantics over process algebras from old ones...
Luca Aceto, Wan Fokkink, Anna Ingólfsd&oacu...