Sciweavers

184 search results - page 31 / 37
» Querying Proofs
Sort
View
PKDD
2009
Springer
184views Data Mining» more  PKDD 2009»
14 years 9 days ago
Boosting Active Learning to Optimality: A Tractable Monte-Carlo, Billiard-Based Algorithm
Abstract. This paper focuses on Active Learning with a limited number of queries; in application domains such as Numerical Engineering, the size of the training set might be limite...
Philippe Rolet, Michèle Sebag, Olivier Teyt...
KR
1994
Springer
13 years 12 months ago
An Application of Terminological Logics to Case-based Reasoning
A key problem in case-based reasoning is the representation, organization and maintenance of case libraries. While current approaches rely on heuristic and psychologically inspire...
Jana Koehler
ADC
2004
Springer
141views Database» more  ADC 2004»
13 years 11 months ago
Conflict Scheduling of Transactions on XML Documents
In the last few years an interest in native XML databases has surfaced. With other authors we argue that such databases need their own provisions for concurrency control since tra...
Stijn Dekeyser, Jan Hidders
CIE
2006
Springer
13 years 11 months ago
Lower Bounds Using Kolmogorov Complexity
Abstract. In this paper, we survey a few recent applications of Kolmogorov complexity to lower bounds in several models of computation. We consider KI complexity of Boolean functio...
Sophie Laplante
CORR
2006
Springer
120views Education» more  CORR 2006»
13 years 7 months ago
Improved Bounds and Schemes for the Declustering Problem
Abstract. The declustering problem is to allocate given data on parallel working storage devices in such a manner that typical requests find their data evenly distributed among the...
Benjamin Doerr, Nils Hebbinghaus, Sören Werth