4377 search results - page 189 / 876 » Mass problems and randomness |
171
click to vote
SDM
2008
SIAM
15 years 8 months ago
2008
SIAM
Understanding the general properties of real social networks has gained much attention due to the proliferation of networked data. The nodes in the network are the individuals and...
188
click to vote
NIPS
2004
15 years 8 months ago
2004
In this paper, we explore the use of Random Forests (RFs) in the structured language model (SLM), which uses rich syntactic information in predicting the next word based on words ...
166
click to vote
SIAMDM
2002
15 years 6 months ago
2002
We present a new class of randomized approximation algorithms for unrelated parallel machine scheduling problems with the average weighted completion time objective. The key idea i...
191
click to vote
PODC
2009
ACM
16 years 7 months ago
2009
ACM
Performing random walks in networks is a fundamental primitive that has found applications in many areas of computer science, including distributed computing. In this paper, we fo...
162
click to vote
FOCS
2002
IEEE
15 years 11 months ago
2002
IEEE
Randomization is vital in cryptography: secret keys should be randomly generated and most cryptographic primitives (e.g., encryption) must be probabilistic. As a bstraction, it is...