Sciweavers

190 search results - page 8 / 38
» A Simple Proof Technique for Certain Parametricity Results
Sort
View
FOCS
1991
IEEE
13 years 11 months ago
A parallel algorithmic version of the Local Lemma
The Lov´asz Local Lemma is a tool that enables one to show that certain events hold with positive, though very small probability. It often yields existence proofs of results with...
Noga Alon
ICCBR
2003
Springer
14 years 22 days ago
An Empirical Analysis of Linear Adaptation Techniques for Case-Based Prediction
This paper is an empirical investigation into the effectiveness of linear scaling adaptation for case-based software project effort prediction. We compare two variants of a linea...
Colin Kirsopp, Emilia Mendes, Rahul Premraj, Marti...
LICS
2007
IEEE
14 years 1 months ago
Environmental Bisimulations for Higher-Order Languages
Developing a theory of bisimulation in higher-order languages can be hard. Particularly challenging can be: (1) the proof of congruence, as well as enhancements of the bisimulatio...
Davide Sangiorgi, Naoki Kobayashi, Eijiro Sumii
CAV
2001
Springer
119views Hardware» more  CAV 2001»
14 years 1 days ago
Certifying Model Checkers
Model Checking is an algorithmic technique to determine whether a temporal property holds of a program. For linear time properties, a model checker produces a counterexample comput...
Kedar S. Namjoshi
TSP
2008
107views more  TSP 2008»
13 years 7 months ago
Time-Scale Modification of Speech Signals
This paper presents methods for independently modifying the time and pitch scale of acoustic signals, with an emphasis on speech signals. The algorithms developed here use paramet...
Brett Ninness, Soren J. Henriksen