Sciweavers

973 search results - page 166 / 195
» Arguing Using Opponent Models
Sort
View
KDD
2006
ACM
128views Data Mining» more  KDD 2006»
14 years 8 months ago
Workload-aware anonymization
Protecting data privacy is an important problem in microdata distribution. Anonymization algorithms typically aim to protect individual privacy, with minimal impact on the quality...
Kristen LeFevre, David J. DeWitt, Raghu Ramakrishn...
HPCA
2007
IEEE
14 years 8 months ago
Colorama: Architectural Support for Data-Centric Synchronization
With the advent of ubiquitous multi-core architectures, a major challenge is to simplify parallel programming. One way to tame one of the main sources of programming complexity, n...
Luis Ceze, Pablo Montesinos, Christoph von Praun, ...
IWSEC
2007
Springer
14 years 1 months ago
Batch Pairing Delegation
Abstract. Pairing-based cryptography (PBC) has enabled the construction of many cryptographic protocols. However, there are scenarios when PBC is too heavyweight to use, such as wh...
Patrick P. Tsang, Sherman S. M. Chow, Sean W. Smit...
COMPSAC
2006
IEEE
14 years 1 months ago
A Communication Virtual Machine
The convergence of data, voice and multimedia communication over digital networks, coupled with continuous improvement in network capacity and reliability has significantly enrich...
Yi Deng, Seyed Masoud Sadjadi, Peter J. Clarke, Ch...
ATVA
2005
Springer
132views Hardware» more  ATVA 2005»
14 years 1 months ago
Flat Counter Automata Almost Everywhere!
Abstract. This paper argues that flatness appears as a central notion in the verification of counter automata. A counter automaton is called flat when its control graph can be ...
Jérôme Leroux, Grégoire Sutre