Sciweavers

4103 search results - page 147 / 821
» Some results on the Collatz problem
Sort
View
PODS
2011
ACM
229views Database» more  PODS 2011»
14 years 9 months ago
On the complexity of privacy-preserving complex event processing
Complex Event Processing (CEP) Systems are stream processing systems that monitor incoming event streams in search of userspecified event patterns. While CEP systems have been ad...
Yeye He, Siddharth Barman, Di Wang, Jeffrey F. Nau...
ESA
2011
Springer
249views Algorithms» more  ESA 2011»
14 years 6 months ago
Improved Algorithms for Partial Curve Matching
Back in 1995, Alt and Godau gave an efficient algorithm for deciding whether a given curve resembles some part of a larger curve under a fixed Fr´echet distance, achieving a runn...
Anil Maheshwari, Jörg-Rüdiger Sack, Kave...
TCC
2012
Springer
226views Cryptology» more  TCC 2012»
14 years 2 months ago
Subspace LWE
The (decisional) learning with errors problem (LWE) asks to distinguish “noisy” inner products of a secret vector with random vectors from uniform. In recent years, the LWE pro...
Krzysztof Pietrzak
ICTAI
1997
IEEE
15 years 10 months ago
GA-Based Performance Analysis of Network Protocols
This paper tackles the problem of analyzing the correctness and performance of a computer network protocol. Given the complexity of the problem, no currently used technique is abl...
Mario Baldi, Fulvio Corno, Maurizio Rebaudengo, Gi...
LICS
2008
IEEE
16 years 1 months ago
The Quest for a Logic Capturing PTIME
The question of whether there is a logic that captures polynomial time is the central open problem in descriptive complexity theory. In my talk, I will review the question and the...
Martin Grohe