Sciweavers

4114 search results - page 486 / 823
» Efficient Algorithms for the 2-Center Problems
Sort
View
SIGMOD
2010
ACM
132views Database» more  SIGMOD 2010»
15 years 1 months ago
Durable top-k search in document archives
We propose and study a new ranking problem in versioned databases. Consider a database of versioned objects which have different valid instances along a history (e.g., documents i...
Leong Hou U, Nikos Mamoulis, Klaus Berberich, Srik...
WWW
2005
ACM
16 years 7 months ago
Sampling search-engine results
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...
Aris Anagnostopoulos, Andrei Z. Broder, David Carm...
159
Voted
ESA
2010
Springer
207views Algorithms» more  ESA 2010»
15 years 7 months ago
Budgeted Red-Blue Median and Its Generalizations
In a Content Distribution Network application, we have a set of servers and a set of clients to be connected to the servers. Often there are a few server types and a hard budget co...
MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kor...
ICDE
2009
IEEE
134views Database» more  ICDE 2009»
16 years 8 months ago
Non-Exposure Location Anonymity
Location cloaking has been proposed and well studied to protect user privacy. It blurs the accurate user location (i.e., a point with coordinates) and replaces it with a well-shape...
Haibo Hu, Jianliang Xu
WWW
2007
ACM
16 years 7 months ago
Exploit sequencing views in semantic cache to accelerate xpath query evaluation
In XML databases, materializing queries and their results into views in a semantic cache can improve the performance of query evaluation by reducing computational complexity and I...
Jianhua Feng, Na Ta, Yong Zhang, Guoliang Li