Sciweavers

4488 search results - page 188 / 898
» Properties of NP-Complete Sets
Sort
View
LICS
2003
IEEE
14 years 1 months ago
Labelled Markov Processes: Stronger and Faster Approximations
This paper reports on and discusses three notions of approximation for Labelled Markov Processes that have been developed last year. The three schemes are improvements over former...
Vincent Danos, Josee Desharnais
CRYPTO
2003
Springer
109views Cryptology» more  CRYPTO 2003»
14 years 1 months ago
On Deniability in the Common Reference String and Random Oracle Model
We revisit the definitions of zero-knowledge in the Common Reference String (CRS) model and the Random Oracle (RO) model. We argue that even though these definitions syntacticall...
Rafael Pass
OOPSLA
2001
Springer
14 years 23 days ago
Object-Oriented Composition Untangled
Object-oriented languages come with pre-defined composition mechanisms, such as inheritance, object composition, or delegation, each characterized by a certain set of composition...
Klaus Ostermann, Mira Mezini
CHI
1998
ACM
14 years 17 days ago
Patterns of Change in Design Metaphor: A Case Study
Although design metaphors play an important role in many software projects, their influence on system functionality, project methodology and the interactions among members of the ...
William A. Stubblefield
ICDT
1995
ACM
101views Database» more  ICDT 1995»
13 years 12 months ago
Approximation in Databases
Partial information in databases can arise when information from several databases is combined. Even if each database is complete for some \world", the combined databases wil...
Leonid Libkin