Sciweavers

1236 search results - page 20 / 248
» Prefix-Like Complexities and Computability in the Limit
Sort
View
65
Voted
CSL
2007
Springer
15 years 3 months ago
Relativizing Small Complexity Classes and Their Theories
Existing definitions of the relativizations of NC1 , L and NL do not preserve the inclusions NC1 ⊆ L, NL ⊆ AC1 . We start by giving the first definitions that preserve them....
Klaus Aehlig, Stephen Cook, Phuong Nguyen
77
Voted
EUROCRYPT
2010
Springer
15 years 2 months ago
Protecting Circuits from Leakage: the Computationally-Bounded and Noisy Cases
Abstract. Physical computational devices leak side-channel information that may, and often does, reveal secret internal states. We present a general transformation that compiles an...
Sebastian Faust, Tal Rabin, Leonid Reyzin, Eran Tr...
DEXAW
2003
IEEE
86views Database» more  DEXAW 2003»
15 years 3 months ago
Towards an Autonomic Distributed Computing System
Increasing hardware performance of desktop computers accounts for a low-cost computing potential that is waiting to be efficiently used. However, the complexity of installation a...
Zoran Constantinescu
ICPR
2008
IEEE
15 years 4 months ago
An approximate algorithm for median graph computation using graph embedding
Graphs are powerful data structures that have many attractive properties for object representation. However, some basic operations are difficult to define and implement, for ins...
Miquel Ferrer, Ernest Valveny, Francesc Serratosa,...
ICPR
2002
IEEE
15 years 10 months ago
A Computationally Efficient Approach to Indoor/Outdoor Scene Classification
Prior research in scene classification has shown that high-level information can be inferred from low-level image features. Classification rates of roughly 90% have been reported ...
Navid Serrano, Andreas E. Savakis, Jiebo Luo