Sciweavers

1391 search results - page 57 / 279
» Complexity Limitations on Quantum Computation
Sort
View
ECCC
2007
123views more  ECCC 2007»
13 years 7 months ago
Lossy Trapdoor Functions and Their Applications
We propose a general cryptographic primitive called lossy trapdoor functions (lossy TDFs), and use it to develop new approaches for constructing several important cryptographic to...
Chris Peikert, Brent Waters
JCC
2007
115views more  JCC 2007»
13 years 7 months ago
The role of radial nodes of atomic orbitals for chemical bonding and the periodic table
: The role of radial nodes, or of their absence, in valence orbitals for chemical bonding and periodic trends is discussed from a unified viewpoint. In particular, we emphasize th...
Martin Kaupp
DEXAW
2003
IEEE
86views Database» more  DEXAW 2003»
14 years 1 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
14 years 2 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
14 years 8 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