13214 search results - page 2582 / 2643 » Pseudorandomness for network algorithms |
127
click to vote
SIGMOD
2001
ACM
16 years 4 months ago
2001
ACM
Estimating the result size of complex queries that involve selection on multiple attributes and the join of several relations is a difficult but fundamental task in database query...
136
click to vote
EDBT
2006
ACM
16 years 4 months ago
2006
ACM
The need of processing graph reachability queries stems from many applications that manage complex data as graphs. The applications include transportation network, Internet traffic...
150
click to vote
ICDE
2010
IEEE
16 years 3 months ago
2010
IEEE
Similarity joins have been studied as key operations in multiple application domains, e.g., record linkage, data cleaning, multimedia and video applications, and phenomena detectio...
164
Voted
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 ...
147
click to vote
WSDM
2010
ACM
16 years 1 months ago
2010
ACM
Recent advances in click model have positioned it as an attractive method for representing user preferences in web search and online advertising. Yet, most of the existing works f...