7006 search results - page 1149 / 1402 » Approximation Algorithms |
181
click to vote
WWW
2005
ACM
16 years 7 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...
193
click to vote
CIKM
2009
Springer
16 years 1 months ago
2009
Springer
We study the problem of continuous monitoring of top-k queries over multiple non-synchronized streams. Assuming a sliding window model, this general problem has been a well addres...
176
click to vote
INFOCOM
2007
IEEE
16 years 22 days ago
2007
IEEE
Abstract— The Internet connectivity in the Autonomous System (AS) level reflects the commercial relationship between ASes. A connection between two ASes could be of type custome...
186
click to vote
SPAA
2004
ACM
15 years 12 months ago
2004
ACM
In this paper, we examine the problem of large-volume data dissemination via overlay networks. A natural way to maximize the throughput of an overlay multicast session is to split...
159
click to vote
CIKM
1999
Springer
15 years 10 months ago
1999
Springer
On-line analytical processing (OLAP) requires e cient processing of complex decision support queries over very large databases. It is well accepted that pre-computed data cubes ca...