Sciweavers

269 search results - page 30 / 54
» Computational soundness of observational equivalence
Sort
View
COCO
2004
Springer
104views Algorithms» more  COCO 2004»
14 years 1 months ago
Quantum Arthur-Merlin Games
This paper studies quantum Arthur–Merlin games, which are Arthur–Merlin games in which Arthur and Merlin can perform quantum computations and Merlin can send Arthur quantum in...
Chris Marriott, John Watrous
EMMCVPR
1999
Springer
14 years 22 days ago
On Fitting Mixture Models
Consider the problem of tting a nite Gaussian mixture, with an unknown number of components, to observed data. This paper proposes a new minimum description length (MDL) type crite...
Mário A. T. Figueiredo, José M. N. L...
EWHCI
1993
14 years 17 days ago
Applying the Wizard of Oz Technique to the Study of Multimodal Systems
The Wizard of Oz (WOz) technique is an experimental evaluation mechanism. It allows the observation of a user operating an apparently fully functioning system whose missing service...
Daniel Salber, Joëlle Coutaz
ICTCS
2007
Springer
14 years 2 months ago
Analyzing Non-Interference with respect to Classes
The information flow property of Non-Interference was recently relaxed into Abstract NonInterference (ANI), a weakened version where attackers can only observe properties of data,...
Damiano Zanardini
ICALP
2010
Springer
14 years 1 months ago
On the Relation between Polynomial Identity Testing and Finding Variable Disjoint Factors
We say that a polynomial f(x1, . . . , xn) is indecomposable if it cannot be written as a product of two polynomials that are defined over disjoint sets of variables. The polynom...
Amir Shpilka, Ilya Volkovich