Sciweavers

148 search results - page 22 / 30
» On the extender algebra being complete
Sort
View
GC
2008
Springer
13 years 7 months ago
Laplacian Spectrum of Weakly Quasi-threshold Graphs
In this paper we study the class of weakly quasi-threshold graphs that are obtained from a vertex by recursively applying the operations (i) adding a new isolated vertex, (ii) addi...
R. B. Bapat, A. K. Lal, Sukanta Pati
ECCC
2007
115views more  ECCC 2007»
13 years 7 months ago
A (De)constructive Approach to Program Checking
Program checking, program self-correcting and program selftesting were pioneered by [Blum and Kannan] and [Blum, Luby and Rubinfeld] in the mid eighties as a new way to gain con...
Shafi Goldwasser, Dan Gutfreund, Alexander Healy, ...
EUROSEC
2009
ACM
14 years 2 months ago
Deep packet anonymization
Network traces of Internet attacks are among the most valuable resources for network analysts and security researchers. However, organizations and researchers are usually reluctan...
Michalis Foukarakis, Demetres Antoniades, Michalis...
VRML
2009
ACM
14 years 2 months ago
Interactive stories on the net: a model and an architecture for X3D worlds
This work discusses a model and an architecture for interactive stories to be displayed on the net, designed for being independent from the specific story represented and suitabl...
Efrem Carnielli, Fabio Pittarello
TARK
2007
Springer
14 years 1 months ago
A normal simulation of coalition logic and an epistemic extension
In this paper we show how coalition logic can be reduced to the fusion of a normal modal STIT logic for agency and a standard normal temporal logic for discrete time, and how this...
Jan Broersen, Andreas Herzig, Nicolas Troquard