2254 search results - page 240 / 451 » Computing the minimal covering set |
260
click to vote
SODA
2012
ACM
13 years 9 months ago
2012
ACM
We give a constant factor approximation algorithm for the following generalization of the k-median problem. We are given a set of clients and facilities in a metric space. Each fa...
191
click to vote
BMCBI
2005
15 years 6 months ago
2005
Background: Structural and functional research often requires the computation of sets of protein structures based on certain properties of the proteins, such as sequence features,...
257
click to vote
CVPR
2009
IEEE
16 years 11 months ago
2009
IEEE
Central to many problems in scene understanding based on using a network of tens, hundreds or even thousands of randomly distributed cameras with on-board processing and wireless c...
187
click to vote
ISAAC
2005
Springer
16 years 4 days ago
2005
Springer
Consider an information network with harmful procedures called attackers (e.g., viruses); each attacker uses a probability distribution to choose a node of the network to damage. O...
192
click to vote
TVLSI
2002
15 years 6 months ago
2002
The performance of many modern computer and communication systems is dictated by the latency of communication pipelines. At the same time, power/energy consumption is often another...