Sciweavers

5084 search results - page 308 / 1017
» Proving Possibility Properties
Sort
View
ACMMSP
2006
ACM
257views Hardware» more  ACMMSP 2006»
16 years 19 days ago
Memory models for open-nested transactions
Open nesting provides a loophole in the strict model of atomic transactions. Moss and Hosking suggested adapting open nesting for transactional memory, and Moss and a group at Sta...
Kunal Agrawal, Charles E. Leiserson, Jim Sukha
COLT
2005
Springer
16 years 6 days ago
On Spectral Learning of Mixtures of Distributions
We consider the problem of learning mixtures of distributions via spectral methods and derive a tight characterization of when such methods are useful. Specifically, given a mixt...
Dimitris Achlioptas, Frank McSherry
ACISP
2004
Springer
16 years 2 days ago
Convertible Nominative Signatures
Abstract. A feasible solution to prevent potential misuse of signatures is to put some restrictions on their verification. Therefore S.J.Kim, S.J.Park and D.H.Won introduced the n...
Zhenjie Huang, Yumin Wang
COCO
2004
Springer
104views Algorithms» more  COCO 2004»
16 years 2 days 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
ECAI
2004
Springer
16 years 1 days ago
New Insights on the Intuitionistic Interpretation of Default Logic
In this work we further investigate the relation, first found by Truszczy´nski, between modal logic S4F and Default Logic (DL), analyzing some interesting properties and showing ...
Pedro Cabalar, David Lorenzo