91 search results - page 15 / 19 » Bounding the Size of k-Tuple Covers |
131
click to vote
PODC
2006
ACM
15 years 5 months ago
2006
ACM
We consider the problem of name-independent routing in doubling metrics. A doubling metric is a metric space whose doubling dimension is a constant, where the doubling dimension o...
187
click to vote
ICDE
2007
IEEE
16 years 1 months ago
2007
IEEE
For location-based services it is often essential to efficiently process proximity relations among mobile objects, such as to establish whether a group of friends or family member...
105
click to vote
ICML
1998
IEEE
16 years 15 days ago
1998
IEEE
In this work, we present a new bottom-up algorithmfor decision tree pruning that is very e cient requiring only a single pass through the given tree, and prove a strong performanc...
100
click to vote
FSTTCS
2009
Springer
15 years 6 months ago
2009
Springer
ABSTRACT. We consider concurrent systems that can be modelled as 1-safe Petri nets communicating through a fixed set of buffers (modelled as unbounded places). We identify a param...
PODC
2005
ACM
15 years 5 months ago
2005
ACM
In this paper, we initiate the study of the approximability of the facility location problem in a distributed setting. In particular, we explore a trade-off between the amount of...