Sciweavers

4126 search results - page 793 / 826
» Relationships with other Formalisms
Sort
View
SIGMOD
2010
ACM
207views Database» more  SIGMOD 2010»
14 years 27 days ago
Automatic contention detection and amelioration for data-intensive operations
To take full advantage of the parallelism offered by a multicore machine, one must write parallel code. Writing parallel code is difficult. Even when one writes correct code, the...
John Cieslewicz, Kenneth A. Ross, Kyoho Satsumi, Y...
KR
2010
Springer
14 years 26 days ago
Probabilistic Description Logics for Subjective Uncertainty
We propose a new family of probabilistic description logics (DLs) that, in contrast to most existing approaches, are derived in a principled way from Halpern’s probabilistic fi...
Carsten Lutz, Lutz Schröder
APN
2001
Springer
14 years 18 days ago
Rewriting Logic as a Unifying Framework for Petri Nets
We propose rewriting logic as a unifying framework for a wide range of Petri nets models. We treat in detail place/transition nets and important extensions of the basic model by in...
Mark-Oliver Stehr, José Meseguer, Peter Csa...
CSCWD
2001
Springer
14 years 17 days ago
Update Algorithms for the Sketch Data Model
The authors have developed a new approach to database interoperability using the sketch data model. That technique has now been used in a number of applications, but an important ...
Michael Johnson, Robert D. Rosebrugh
EUROCRYPT
2001
Springer
14 years 17 days ago
Cryptographic Counters and Applications to Electronic Voting
We formalize the notion of a cryptographic counter, which allows a group of participants to increment and decrement a cryptographic representation of a (hidden) numerical value pri...
Jonathan Katz, Steven Myers, Rafail Ostrovsky