Sciweavers

381 search results - page 13 / 77
» On the advantage over a random assignment
Sort
View
KDD
2009
ACM
305views Data Mining» more  KDD 2009»
14 years 9 months ago
Grocery shopping recommendations based on basket-sensitive random walk
We describe a recommender system in the domain of grocery shopping. While recommender systems have been widely studied, this is mostly in relation to leisure products (e.g. movies...
Ming Li, M. Benjamin Dias, Ian H. Jarman, Wael El-...
PQCRYPTO
2010
250views Cryptology» more  PQCRYPTO 2010»
14 years 1 months ago
Strongly Unforgeable Signatures and Hierarchical Identity-Based Signatures from Lattices without Random Oracles
Abstract. We propose a variant of the “bonsai tree” signature scheme, a latticebased existentially unforgeable signature scheme in the standard model. Our construction offers ...
Markus Rückert
IJCAI
2007
13 years 10 months ago
Document Summarization Using Conditional Random Fields
Many methods, including supervised and unsupervised algorithms, have been developed for extractive document summarization. Most supervised methods consider the summarization task ...
Dou Shen, Jian-Tao Sun, Hua Li, Qiang Yang, Zheng ...
CRYPTO
2005
Springer
94views Cryptology» more  CRYPTO 2005»
14 years 2 months ago
Improved Security Analyses for CBC MACs
We present an improved bound on the advantage of any q-query adversary at distinguishing between the CBC MAC over a random n-bit permutation and a random function outputting n bit...
Mihir Bellare, Krzysztof Pietrzak, Phillip Rogaway
SIAMAM
2000
128views more  SIAMAM 2000»
13 years 9 months ago
Advection-Diffusion Equations for Internal State-Mediated Random Walks
Abstract. In many biological examples of biased random walks, movement statistics are determined by state dynamics that are internal to the organism or cell and that mediate respon...
Daniel Grünbaum