7296 search results - page 1309 / 1460 » informs 2010 |
164
click to vote
WSDM
2010
ACM
16 years 1 months ago
2010
ACM
Knowledge-sharing communities like Wikipedia and automated extraction methods like those of DBpedia enable the construction of large machine-processible knowledge bases with relat...
165
click to vote
WSDM
2010
ACM
16 years 1 months ago
2010
ACM
In this paper, we study search bot traffic from search engine query logs at a large scale. Although bots that generate search traffic aggressively can be easily detected, a large ...
133
click to vote
ICS
2010
Tsinghua U.
16 years 1 months ago
2010
Tsinghua U.
We introduce the notion of "non-malleable codes" which relaxes the notion of error-correction and errordetection. Informally, a code is non-malleable if the message cont...
147
click to vote
SOFSEM
2010
Springer
16 years 1 months ago
2010
Springer
Regret minimization has proven to be a very powerful tool in both computational learning theory and online algorithms. Regret minimization algorithms can guarantee, for a single de...
129
click to vote
CSCW
2010
ACM
16 years 1 months ago
2010
ACM
Online production groups have the potential to transform the way that knowledge is produced and disseminated. One of the most widely used forms of online production is the wiki, w...