Sciweavers

15792 search results - page 287 / 3159
» Computational Abstraction Steps
Sort
View
PODS
2010
ACM
159views Database» more  PODS 2010»
15 years 9 months ago
On probabilistic fixpoint and Markov chain query languages
We study highly expressive query languages such as datalog, fixpoint, and while-languages on probabilistic databases. We generalize these languages such that computation steps (e....
Daniel Deutch, Christoph Koch, Tova Milo
COMPUTING
2004
115views more  COMPUTING 2004»
15 years 7 months ago
Length Preserving Multiresolution Editing of Curves
In this paper a method for multiresolution deformation of planar piecewise linear curves that preserves the curve length is presented. In a wavelet based multiresolution editing f...
Basile Sauvage, Stefanie Hahmann, Georges-Pierre B...
MINENET
2006
ACM
16 years 1 months ago
SC2D: an alternative to trace anonymization
Progress in networking research depends crucially on applying novel analysis tools to real-world traces of network activity. This often conflicts with privacy and security requir...
Jeffrey C. Mogul, Martin F. Arlitt
STOC
1989
ACM
117views Algorithms» more  STOC 1989»
15 years 11 months ago
On the Theory of Average Case Complexity
This paper takes the next step in developing the theory of average case complexity initiated by Leonid A Levin. Previous works Levin 84, Gurevich 87, Venkatesan and Levin 88] have...
Shai Ben-David, Benny Chor, Oded Goldreich, Michae...
EUROCAST
2007
Springer
122views Hardware» more  EUROCAST 2007»
15 years 11 months ago
Generation of Indexes for Compiling Efficient Parsers from Formal Specifications
abstract Parsing schemata [4] provide a formal, simple and uniform way to describe, analyze and compare different parsing algorithms. The notion of a parsing schema comes from cons...
Carlos Gómez-Rodríguez, Miguel A. Al...