7228 search results - page 592 / 1446 » From Algorithmic to Subjective Randomness |
213
click to vote
WWW
2009
ACM
16 years 7 months ago
2009
ACM
In this paper we describe a problem of discovering query clusters from a click-through graph of web search logs. The graph consists of a set of web search queries, a set of pages ...
203
click to vote
STOC
2001
ACM
16 years 7 months ago
2001
ACM
The dynamic behavior of a network in which information is changing continuously over time requires robust and efficient mechanisms for keeping nodes updated about new information. ...
162
click to vote
STOC
2010
ACM
16 years 4 months ago
2010
ACM
We give near-optimal constructions of extractors secure against quantum bounded-storage adversaries. One instantiation gives the first such extractor to achieve an output length (...
223
click to vote
ESA
2003
Springer
16 years 11 days ago
2003
Springer
We propose a new complexity measure for movement of objects, the smoothed motion complexity. Many applications are based on algorithms dealing with moving objects, but usually data...
214
click to vote
SDM
2003
SIAM
15 years 8 months ago
2003
SIAM
The singular value decomposition (SVD) is fundamental to many data modeling/mining algorithms, but SVD algorithms typically have quadratic complexity and require random access to ...