1136 search results - page 186 / 228 » Finding Small Holes |
142
Voted
WWW
2007
ACM
16 years 4 months ago
2007
ACM
This paper is concerned with the problem of browsing social annotations. Today, a lot of services (e.g., Del.icio.us, Filckr) have been provided for helping users to manage and sh...
143
click to vote
WWW
2005
ACM
16 years 4 months ago
2005
ACM
We consider the problem of efficiently sampling Web search engine query results. In turn, using a small random sample instead of the full set of results leads to efficient approxi...
110
click to vote
CHI
2009
ACM
16 years 4 months ago
2009
ACM
Although usability is the core aspect of the whole HCI research field, it still waits for its economic breakthrough. There are some corporations that are famous for their usable p...
138
Voted
EUROCRYPT
2009
Springer
16 years 4 months ago
2009
Springer
Almost any cryptographic scheme can be described by tweakable polynomials over GF(2), which contain both secret variables (e.g., key bits) and public variables (e.g., plaintext bit...
142
click to vote
KDD
2009
ACM
16 years 4 months ago
2009
ACM
We propose two approximation algorithms for identifying communities in dynamic social networks. Communities are intuitively characterized as "unusually densely knit" sub...