Sciweavers

1786 search results - page 81 / 358
» The Structure of Factor Oracles
Sort
View
LFCS
1992
Springer
15 years 5 months ago
Banishing Robust Turing Completeness
This paper proves that "promise classes" are so fragilely structured that they do not robustly (i.e. with respect to all oracles) possess Turinghard sets even in classes...
Lane A. Hemachandra, Sanjay Jain, Nikolai K. Veres...
127
Voted
DASFAA
2004
IEEE
158views Database» more  DASFAA 2004»
15 years 4 months ago
A Cost Model for Spatial Intersection Queries on RI-Trees
Abstract. The efficient management of interval sequences represents a core requirement for many temporal and spatial database applications. With the Relational Interval Tree (RI-tr...
Hans-Peter Kriegel, Martin Pfeifle, Marco Pöt...
IEEECIT
2010
IEEE
14 years 11 months ago
On Small Subgroup Non-confinement Attack
The small subgroup confinement attack works by confining cryptographic operations within a small subgroup, in which exhaustive search is feasible. This attack is overt and hence ca...
Feng Hao
141
Voted
BMCBI
2011
14 years 4 months ago
Determinants of Antigenicity and Specificity in immune response for Protein Sequences
Background: Target specific antibodies are pivotal for the design of vaccines, immunodiagnostic tests, studies on proteomics for cancer biomarker discovery, identification of prot...
Yulong Wang, Wenjun Wu, Nicolas N. Negre, Kevin P....
152
Voted
STOC
2012
ACM
221views Algorithms» more  STOC 2012»
13 years 3 months ago
From query complexity to computational complexity
We consider submodular optimization problems, and provide a general way of translating oracle inapproximability results arising from the symmetry gap technique to computational co...
Shahar Dobzinski, Jan Vondrák