Sciweavers

1449 search results - page 204 / 290
» Self-Randomized Exponentiation Algorithms
Sort
View
CCS
2008
ACM
15 years 8 months ago
Multisignatures secure under the discrete logarithm assumption and a generalized forking lemma
Multisignatures allow n signers to produce a short joint signature on a single message. Multisignatures were achieved in the plain model with a non-interactive protocol in groups ...
Ali Bagherzandi, Jung Hee Cheon, Stanislaw Jarecki
CIKM
2008
Springer
15 years 8 months ago
SoRec: social recommendation using probabilistic matrix factorization
Data sparsity, scalability and prediction quality have been recognized as the three most crucial challenges that every collaborative filtering algorithm or recommender system conf...
Hao Ma, Haixuan Yang, Michael R. Lyu, Irwin King
COMPGEOM
2008
ACM
15 years 8 months ago
Towards persistence-based reconstruction in euclidean spaces
Manifold reconstruction has been extensively studied for the last decade or so, especially in two and three dimensions. Recent advances in higher dimensions have led to new method...
Frédéric Chazal, Steve Oudot
NIPS
2007
15 years 7 months ago
The Price of Bandit Information for Online Optimization
In the online linear optimization problem, a learner must choose, in each round, a decision from a set D ⊂ Rn in order to minimize an (unknown and changing) linear cost function...
Varsha Dani, Thomas P. Hayes, Sham Kakade
AAAI
2004
15 years 7 months ago
Combinatorial Auctions with Structured Item Graphs
Combinatorial auctions (CAs) are important mechanisms for allocating interrelated items. Unfortunately, winner determination is NP-complete unless there is special structure. We s...
Vincent Conitzer, Jonathan Derryberry, Tuomas Sand...