Sciweavers

8431 search results - page 1558 / 1687
» Algorithmically Independent Sequences
Sort
View
INFOCOM
2000
IEEE
15 years 1 months ago
Effective Envelopes: Statistical Bounds on Multiplexed Traffic in Packet Networks
Abstract--A statistical network service which allows a certain fraction of traffic to not meet its QoS guarantees can extract additional capacity from a network by exploiting stati...
Robert Boorstyn, Almut Burchard, Jörg Liebehe...
STOC
1991
ACM
84views Algorithms» more  STOC 1991»
15 years 1 months ago
Self-Testing/Correcting for Polynomials and for Approximate Functions
The study of self-testing/correcting programs was introduced in [8] in order to allow one to use program P to compute function f without trusting that P works correctly. A self-te...
Peter Gemmell, Richard J. Lipton, Ronitt Rubinfeld...
CCS
2008
ACM
15 years 14 hour 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 hour 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
CIKM
2008
Springer
15 years 8 hour ago
Modeling hidden topics on document manifold
Topic modeling has been a key problem for document analysis. One of the canonical approaches for topic modeling is Probabilistic Latent Semantic Indexing, which maximizes the join...
Deng Cai, Qiaozhu Mei, Jiawei Han, Chengxiang Zhai
« Prev « First page 1558 / 1687 Last » Next »