599 search results - page 116 / 120 » Approximation Algorithms for Dominating Set in Disk Graphs |
CORR
2010
Springer
13 years 7 months ago
2010
Springer
In this paper we show how the complexity of performing nearest neighbor (NNS) search on a metric space is related to the expansion of the metric space. Given a metric space we loo...
INFOCOM
1998
IEEE
13 years 12 months ago
1998
IEEE
We present the Informed-Source Coding-On-Demand (ISCOD) approach for efficiently supplying non-identical data from a central server to multiple caching clients through a broadcast ...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
We consider the problem of identifying a team of skilled individuals for collaboration, in the presence of a social network. Each node in the input social network may be an expert...
AFRIGRAPH
2003
ACM
13 years 11 months ago
2003
ACM
Using a radiosity method to estimate light inter-reflections within large scenes still remains a difficult task. The two main reasons are: (i) the computations entailed by the rad...
CODES
2003
IEEE
14 years 28 days ago
2003
IEEE
We present an approach to the automatic derivation of executable Process Network specifications from Weakly Dynamic Applications. We introduce the notions of Dynamic Single Assig...