Sciweavers

1192 search results - page 185 / 239
» Computing Weakest Readings
Sort
View
SIAMDM
2002
124views more  SIAMDM 2002»
15 years 1 months ago
Counting Claw-Free Cubic Graphs
Let Hn be the number of claw-free cubic graphs on 2n labeled nodes. Combinatorial reductions are used to derive a second order, linear homogeneous differential equation with polyno...
Edgar M. Palmer, Ronald C. Read, Robert W. Robinso...
101
Voted
SP
2002
IEEE
110views Security Privacy» more  SP 2002»
15 years 1 months ago
Optical Time-Domain Eavesdropping Risks of CRT Displays
A new eavesdropping technique can be used to read cathode-ray tube (CRT) displays at a distance. The intensity of the light emitted by a raster-scan screen as a function of time c...
Markus G. Kuhn
NAR
2007
152views more  NAR 2007»
15 years 1 months ago
COMPASS server for remote homology inference
COMPASS is a method for homology detection and local alignment construction based on the comparison of multiple sequence alignments (MSAs). The method derives numerical profiles f...
Ruslan Sadreyev, Ming Tang, Bong-Hyun Kim, Nick V....
TOPLAS
2010
93views more  TOPLAS 2010»
15 years 10 days ago
Semantics of fractional permissions with nesting
Fractional permissions use fractions to distinguish write access (1) from read access (any smaller fraction). Nesting (an extension of adoption) can be used to model object invari...
John Tang Boyland
AGP
2010
IEEE
15 years 6 hour ago
Concurrent and Reactive Constraint Programming
The Italian Logic Programming community has given several contributions to the theory of Concurrent Constraint Programming. In particular, in the topics of semantics, verification,...
Maurizio Gabbrielli, Catuscia Palamidessi, Frank D...