465 search results - page 80 / 93 » On the Hardness of Range Assignment Problems |
109
click to vote
CHI
2004
ACM
16 years 4 days ago
2004
ACM
This paper describes the concepts of TEA, a flexible tool that supports user tests by automating repetitive tasks and collecting data of user inputs and actions. TEA was specifica...
PODS
2008
ACM
15 years 12 months ago
2008
ACM
In the study of data exchange one usually assumes an openworld semantics, making it possible to extend instances of target schemas. An alternative closed-world semantics only move...
SIGCOMM
2009
ACM
15 years 6 months ago
2009
ACM
IPTV is increasingly being deployed and offered as a commercial service to residential broadband customers. Compared with traditional ISP networks, an IPTV distribution network (i...
156
click to vote
SSD
2007
Springer
15 years 5 months ago
2007
Springer
In the k-medoid problem, given a dataset P, we are asked to choose k points in P as the medoids. The optimal medoid set minimizes the average Euclidean distance between the points ...
PODC
2005
ACM
15 years 5 months ago
2005
ACM
One of the fundamental problems in distributed computing is how to efficiently perform routing in a faulty network in which each link fails with some probability. This paper inves...