535 search results - page 93 / 107 » Checking Computations in Polylogarithmic Time |
FOCS
2007
IEEE
14 years 2 months ago
2007
IEEE
: We study the computational strength of quantum particles (each of finite dimensionality) arranged on a line. First, we prove that it is possible to perform universal adiabatic q...
SIGECOM
2005
ACM
14 years 1 months ago
2005
ACM
We study various computational aspects of solving games using dominance and iterated dominance. We first study both strict and weak dominance (not iterated), and show that checki...
ICDT
2010
ACM
13 years 6 months ago
2010
ACM
We propose a greedy algorithm which, given a hypergraph H and a positive integer k, produces a hypertree decomposition of width less than or equal to 3k −1, or determines that H...
ACSAC
2009
IEEE
13 years 11 months ago
2009
IEEE
Abstract--Current Network Access Control (NAC) technologies manage the access of new devices into a network to prevent rogue devices from attacking network hosts or services. Typic...
DAC
2008
ACM
13 years 9 months ago
2008
ACM
Security of MPSoCs is an emerging area of concern in embedded systems. Security is jeopardized by code injection attacks, which are the most common types of software attacks. Prev...