Sciweavers

821 search results - page 41 / 165
» Using State Modules for Adaptive Query Processing
Sort
View
STACS
2001
Springer
14 years 2 days ago
Small PCPs with Low Query Complexity
Most known constructions of probabilistically checkable proofs (PCPs) either blow up the proof size by a large polynomial, or have a high (though constant) query complexity. In thi...
Prahladh Harsha, Madhu Sudan
TACAS
2000
Springer
138views Algorithms» more  TACAS 2000»
13 years 11 months ago
Symbolic Model Checking of Probabilistic Processes Using MTBDDs and the Kronecker Representation
This paper reports on experimental results with symbolic model checking of probabilistic processes based on Multi-Terminal Binary Decision Diagrams (MTBDDs). We consider concurrent...
Luca de Alfaro, Marta Z. Kwiatkowska, Gethin Norma...
SAC
2009
ACM
14 years 2 months ago
Adaptive burst detection in a stream engine
Detecting bursts in data streams is an important and challenging task. Due to the complexity of this task, usually burst detection cannot be formulated using standard query operat...
Marcel Karnstedt, Daniel Klan, Christian Pöli...
COLING
2002
13 years 7 months ago
An XML-based Document Suite
We report about the current state of development of a document suite and its applications. This collection of tools for the flexible and robust processing of documents in German i...
Dietmar Rösner, Manuela Kunze
AH
2004
Springer
14 years 1 months ago
The Personal Reader: Personalizing and Enriching Learning Resources Using Semantic Web Technologies.
Traditional adaptive hypermedia systems have focused on providing adaptation functionality on a closed corpus, while Web search interfaces have delivered non-personalized informati...
Peter Dolog, Nicola Henze, Wolfgang Nejdl, Michael...