11345 search results - page 2268 / 2269 » Foundations of Computer Science |
SODA
2012
ACM
11 years 10 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...
MOBIHOC
2004
ACM
14 years 7 months ago
2004
ACM
We propose several novel localized algorithms to construct energy efficient routing structures for homogeneous wireless ad hoc networks, where all nodes have same maximum transmis...
ICS
2009
Tsinghua U.
14 years 2 months ago
2009
Tsinghua U.
The L2 cache is commonly managed using LRU policy. For workloads that have a working set larger than L2 cache, LRU behaves poorly, resulting in a great number of less reused lines...
FCT
2009
Springer
14 years 2 months ago
2009
Springer
Suppose that we are given a set of n elements d of which are “defective”. A group test can check for any subset, called a pool, whether it contains a defective. It is well know...
ACISP
1997
Springer
13 years 11 months ago
1997
Springer
tracts, pp. 11-17. (http://www.qucis.queens.ca/achallc97/papers/p028.html) Alexa, Melina; Rostek, Lothar Pattern Concordances - TATOE calls XGrammar. Presented at ACH -ALLC97, King...