Sciweavers

551 search results - page 101 / 111
» Formalizing the Logic-Automaton Connection
Sort
View
TCC
2009
Springer
141views Cryptology» more  TCC 2009»
14 years 9 months ago
Proofs of Retrievability via Hardness Amplification
Proofs of Retrievability (PoR), introduced by Juels and Kaliski [JK07], allow the client to store a file F on an untrusted server, and later run an efficient audit protocol in whi...
Yevgeniy Dodis, Salil P. Vadhan, Daniel Wichs
KDD
2008
ACM
217views Data Mining» more  KDD 2008»
14 years 8 months ago
Stream prediction using a generative model based on frequent episodes in event sequences
This paper presents a new algorithm for sequence prediction over long categorical event streams. The input to the algorithm is a set of target event types whose occurrences we wis...
Srivatsan Laxman, Vikram Tankasali, Ryen W. White
POPL
2010
ACM
14 years 5 months ago
Dependent types and program equivalence
The definition of type equivalence is one of the most important design issues for any typed language. In dependentlytyped languages, because terms appear in types, this definition...
Jianzhou Zhao, Limin Jia, Stephanie Weirich, Vilhe...
DEXA
2009
Springer
151views Database» more  DEXA 2009»
14 years 3 months ago
Automatic Extraction of Ontologies Wrapping Relational Data Sources
Describing relational data sources (i.e. databases) by means of ontologies constitutes the foundation of most of the semantic based approaches to data access and integration. In sp...
Lina Lubyte, Sergio Tessaris
GECCO
2009
Springer
14 years 3 months ago
On the performance effects of unbiased module encapsulation
A recent theoretical investigation of modular representations shows that certain modularizations can introduce a distance bias into a landscape. This was a static analysis, and em...
R. Paul Wiegand, Gautham Anil, Ivan I. Garibay, Oz...