Sciweavers

3875 search results - page 684 / 775
» Approximation algorithms for the 0-extension problem
Sort
View
INFOCOM
2007
IEEE
15 years 4 months ago
Acyclic Type of Relationships Between Autonomous Systems
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...
Rami Cohen, Danny Raz
SIGIR
2010
ACM
14 years 10 months ago
Optimal meta search results clustering
By analogy with merging documents rankings, the outputs from multiple search results clustering algorithms can be combined into a single output. In this paper we study the feasibi...
Claudio Carpineto, Giovanni Romano
SIGMOD
2005
ACM
133views Database» more  SIGMOD 2005»
15 years 10 months ago
Constrained Optimalities in Query Personalization
Personalization is a powerful mechanism that helps users to cope with the abundance of information on the Web. Database query personalization achieves this by dynamically construc...
Georgia Koutrika, Yannis E. Ioannidis
SSD
2005
Springer
98views Database» more  SSD 2005»
15 years 3 months ago
Medoid Queries in Large Spatial Databases
Assume that a franchise plans to open k branches in a city, so that the average distance from each residential block to the closest branch is minimized. This is an instance of the ...
Kyriakos Mouratidis, Dimitris Papadias, Spiros Pap...
INFOCOM
2003
IEEE
15 years 3 months ago
Improving Web Performance in Broadcast-Unicast Networks
— Satellite operators have recently begun offering Internet access over their networks. Typically, users connect to the network using a modem for uplink, and a satellite dish for...
Mukesh Agrawal, Amit Manjhi, Nikhil Bansal, Sriniv...