Sciweavers

5592 search results - page 715 / 1119
» On Random Betweenness Constraints
Sort
View
SAC
2006
ACM
16 years 1 months ago
Trust-decisions on the base of maximal information of recommended direct-trust
Nowadays the concept of trust in computer communications starts to get more and more popular. While the idea of trust in human interaction seems to be obvious and understandable i...
Uwe Roth, Volker Fusenig
CVPR
2010
IEEE
16 years 1 months ago
Weakly-Supervised Hashing in Kernel Space
The explosive growth of the vision data motivates the recent studies on efficient data indexing methods such as locality-sensitive hashing (LSH). Most existing approaches perform...
Yadong Mu, Jialie Shen, Shuicheng Yan
SIGECOM
2005
ACM
117views ECommerce» more  SIGECOM 2005»
16 years 1 months ago
First-price path auctions
We study first-price auction mechanisms for auctioning flow between given nodes in a graph. A first-price auction is any auction in which links on winning paths are paid their ...
Nicole Immorlica, David R. Karger, Evdokia Nikolov...
TCC
2005
Springer
113views Cryptology» more  TCC 2005»
16 years 1 months ago
Entropic Security and the Encryption of High Entropy Messages
Russell and Wang [22] recently introduced an elegant, information-theoretic notion called entropic security of encryption: they required that the cipher text leak no predicate of ...
Yevgeniy Dodis, Adam Smith
MSWIM
2004
ACM
16 years 1 months ago
Outdoor experimental comparison of four ad hoc routing algorithms
Most comparisons of wireless ad hoc routing algorithms involve simulated or indoor trial runs, or outdoor runs with only a small number of nodes, potentially leading to an incorre...
Robert S. Gray, David Kotz, Calvin C. Newport, Nik...