Sciweavers

20175 search results - page 109 / 4035
» Is abstraction the key to computing
Sort
View
CORR
2008
Springer
138views Education» more  CORR 2008»
15 years 24 days ago
Computing Minimum Spanning Trees with Uncertainty
Abstract. We consider the minimum spanning tree problem in a setting where information about the edge weights of the given graph is uncertain. Initially, for each edge e of the gra...
Thomas Erlebach, Michael Hoffmann 0002, Danny Kriz...
CCS
2001
ACM
15 years 5 months ago
A Cryptanalysis of the High-Bandwidth Digital Content Protection System
Abstract. We describe a weakness in the High Bandwidth Digital Content Protection (HDCP) scheme which may lead to practical attacks. HDCP is a proposed identity-based cryptosystem ...
Scott Crosby, Ian Goldberg, Robert Johnson, Dawn X...
99
Voted
SAS
2009
Springer
148views Formal Methods» more  SAS 2009»
16 years 1 months ago
Abstract Interpretation from a Topological Perspective
Interpretation from a Topological Perspective David A. Schmidt Kansas State University, Manhattan, Kansas, USA Abstract. Topology is the study of property sets (open sets) and cont...
David A. Schmidt
TCS
2008
15 years 18 days ago
Using bisimulation proof techniques for the analysis of distributed abstract machines
Analysis of Distributed Abstract Machines Damien Pous ENS Lyon, France. We illustrate the use of recently developed proof techniques for weak bisimulation sing a generic framework...
Damien Pous
ENTCS
2007
89views more  ENTCS 2007»
15 years 20 days ago
Quantum Programs With Classical Output Streams: (Extended Abstract)
d abstract) Dominique Unruh 1 Institut f¨ur Algorithmen und Kognitive Systeme, Universit¨at Karlsruhe Am Fasanengarten 5, 76131 Karlsruhe, Germany We show how to model the seman...
Dominique Unruh