Sciweavers

903 search results - page 83 / 181
» On the reduction of a random basis
Sort
View
SIGECOM
2010
ACM
164views ECommerce» more  SIGECOM 2010»
15 years 11 months ago
Truthful mechanisms with implicit payment computation
It is widely believed that computing payments needed to induce truthful bidding is somehow harder than simply computing the allocation. We show that the opposite is true for singl...
Moshe Babaioff, Robert D. Kleinberg, Aleksandrs Sl...
CRYPTO
2001
Springer
113views Cryptology» more  CRYPTO 2001»
15 years 10 months ago
OAEP Reconsidered
The OAEP encryption scheme was introduced by Bellare and Rogaway at Eurocrypt ’94. It converts any trapdoor permutation scheme into a public-key encryption scheme. OAEP is widel...
Victor Shoup
ICML
2003
IEEE
16 years 7 months ago
Learning Distance Functions using Equivalence Relations
We address the problem of learning distance metrics using side-information in the form of groups of "similar" points. We propose to use the RCA algorithm, which is a sim...
Aharon Bar-Hillel, Tomer Hertz, Noam Shental, Daph...
CGO
2003
IEEE
15 years 11 months ago
Adaptive Online Context-Sensitive Inlining
As current trends in software development move toward more complex object-oriented programming, inlining has become a vital optimization that provides substantial performance impr...
Kim M. Hazelwood, David Grove
WISE
2002
Springer
15 years 11 months ago
Taxonomies in Operation, Design, and Meta-Design
Taxonomies are a well-established instrument for organizing and accessing resources in Information, Content and Knowledge Management (ICKM) systems. Furthermore, they contribute t...
Claudia Niederée, Claudio Muscogiuri, Matth...