Sciweavers

686 search results - page 56 / 138
» On the General Applicability of Instruction-Set Randomizatio...
Sort
View
CCS
2010
ACM
15 years 4 months ago
Securing wireless sensor networks against large-scale node capture attacks
Securing wireless sensor networks against node capture is a challenging task. All well-known random key pre-distribution systems, including the Eschenauer and Gligor's pionee...
Tuan Manh Vu, Reihaneh Safavi-Naini, Carey William...
147
Voted
SAC
2008
ACM
15 years 2 months ago
A biologically inspired generation of virtual characters
A number of techniques for generating geometric models of human head and body are in use nowadays. Models of human characters are useful in computer games, virtual reality, and ma...
Roberto C. Cavalcante Vieira, Creto Augusto Vidal,...
108
Voted
COLT
2007
Springer
15 years 9 months ago
Occam's Hammer
Abstract. We establish a generic theoretical tool to construct probabilistic bounds for algorithms where the output is a subset of objects from an initial pool of candidates (or mo...
Gilles Blanchard, François Fleuret
SAT
2004
Springer
131views Hardware» more  SAT 2004»
15 years 8 months ago
A Comparative Study of 2QBF Algorithms
2QBF is the problem of evaluating a Quantified Boolean Formula (QBF) with two levels of quantification. Many practical problems in sequential verification can be formulated as i...
Darsh P. Ranjan, Daijue Tang, Sharad Malik
FMOODS
2003
15 years 4 months ago
A Rewriting Based Model for Probabilistic Distributed Object Systems
Concurrent and distributed systems have traditionally been modelled using nondeterministic transitions over configurations. The minism provides an abstraction over scheduling, net...
Nirman Kumar, Koushik Sen, José Meseguer, G...