Sciweavers

8695 search results - page 394 / 1739
» Making the Complex Simple
Sort
View
CORR
2011
Springer
156views Education» more  CORR 2011»
15 years 1 months ago
Impossibility of Succinct Quantum Proofs for Collision-Freeness
We show that any quantum algorithm to decide whether a function f : [n] → [n] is a permutation or far from a permutation must make Ω n1/3 /w queries to f, even if the algorith...
Scott Aaronson
CORR
2006
Springer
140views Education» more  CORR 2006»
15 years 7 months ago
Nearly optimal exploration-exploitation decision thresholds
While in general trading off exploration and exploitation in reinforcement learning is hard, under some formulations relatively simple solutions exist. Optimal decision thresholds ...
Christos Dimitrakakis
INFOCOM
2012
IEEE
13 years 9 months ago
Low-stretch greedy embedding heuristics
—Greedy embedding is a graph embedding that makes the simple greedy packet forwarding scheme successful for every source-destination pair. It is desirable that graph embeddings a...
Andrej Cvetkovski, Mark Crovella
ICCV
2007
IEEE
16 years 8 months ago
Spherical-Homoscedastic Shapes
Shape analysis requires invariance under translation, scale and rotation. Translation and scale invariance can be realized by normalizing shape vectors with respect to their mean ...
Onur C. Hamsici, Aleix M. Martínez
NAR
2011
241views Computer Vision» more  NAR 2011»
15 years 1 months ago
PRIDB: a protein-RNA interface database
The Protein–RNA Interface Database (PRIDB) is a comprehensive database of protein–RNA interfaces extracted from complexes in the Protein Data Bank (PDB). It is designed to fac...
Benjamin A. Lewis, Rasna R. Walia, Michael Terribi...