Sciweavers

250 search results - page 25 / 50
» Verifying Tolerant Systems Using Polynomial Approximations
Sort
View
80
Voted
COCO
2007
Springer
111views Algorithms» more  COCO 2007»
15 years 1 months ago
Efficient Arguments without Short PCPs
Current constructions of efficient argument systems combine a short (polynomial size) PCP with a cryptographic hashing technique. We suggest an alternative approach for this probl...
Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky
ICASSP
2011
IEEE
14 years 1 months ago
Bird species recognition combining acoustic and sequence modeling
The goal of this work was to explore modeling techniques to improve bird species classification from audio samples. We first developed an unsupervised approach to obtain approxima...
Martin Graciarena, Michelle Delplanche, Elizabeth ...
CONCUR
2001
Springer
15 years 2 months ago
A Static Analysis Technique for Graph Transformation Systems
In this paper we introduce a static analysis technique for graph transformation systems. We present an algorithm which, given a graph transformation system and a start graph, produ...
Paolo Baldan, Andrea Corradini, Barbara König
TCS
2008
14 years 9 months ago
Integration of a security type system into a program logic
Type systems and program logics are often conceived to be at opposing ends of the spectrum of formal software analyses. In this paper we show that a flow-sensitive type system ensu...
Reiner Hähnle, Jing Pan, Philipp Rümmer,...
COR
2008
131views more  COR 2008»
14 years 8 months ago
Queueing analysis of a server node in transaction processing middleware systems
Quantitative performance modeling of complex information systems is of immense importance for designing enterprise e-business infrastructures and applications. In this paper, we p...
Wei Xiong, Tayfur Altiok