5115 search results - page 409 / 1023 » On Randomized Lanczos Algorithms |
235
click to vote
STOC
2009
ACM
16 years 8 months ago
2009
ACM
We study the question of basing symmetric key cryptography on weak secrets. In this setting, Alice and Bob share an n-bit secret W, which might not be uniformly random, but the ad...
200
click to vote
STOC
2004
ACM
16 years 7 months ago
2004
ACM
Abstract. We give the first exponential separation between quantum and bounded-error randomized one-way communication complexity. Specifically, we define the Hidden Matching Proble...
212
click to vote
MCS
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. Cluster ensembles are deemed to be better than single clustering algorithms for discovering complex or noisy structures in data. Various heuristics for constructing such ...
214
click to vote
SAC
2008
ACM
15 years 7 months ago
2008
ACM
A number of techniques for generating geometric models of human head and body are in use nowadays. Models of human characters are useful in computer games, virtual reality, and ma...
187
click to vote
SIGMETRICS
2006
ACM
16 years 1 months ago
2006
ACM
A major challenge in the design of wireless networks is the need for distributed scheduling algorithms that will efficiently share the common spectrum. Recently, a few distributed...