256 search results - page 27 / 52 » Separation of NP-Completeness Notions |
STOC
2009
ACM
16 years 12 days ago
2009
ACM
Non-relativization of complexity issues can be interpreted as giving some evidence that these issues cannot be resolved by "black-box" techniques. In the early 1990'...
ICB
2009
Springer
15 years 6 months ago
2009
Springer
ic Presentations - Abstracts list Monday, August 31st Session 1 – Chairman: Jean-Marc Odobez Title Quality Measures and Stacking Classifiers in Multimodal Biometric Recognition S...
185
click to vote
ICDE
2005
IEEE
16 years 1 months ago
2005
IEEE
Vertical partitioning is a well-known technique for optimizing query performance in relational databases. An extreme form of this technique, which we call vectorization, is to sto...
114
click to vote
PKC
2009
Springer
16 years 10 days ago
2009
Springer
Abstract.We introduce the notion of distributed password-based publickey cryptography, where a virtual high-entropy private key is implicitly dened as a concatenation of low-entrop...
197
click to vote
POPL
2005
ACM
16 years 3 days ago
2005
ACM
Traditional class and object encodings are difficult to use in practical type-preserving compilers because of the complexity of the encodings. We propose a simple typed intermedia...