133 search results - page 15 / 27 » Approximate Hypergraph Partitioning and Applications |
164
click to vote
ASPLOS
2009
ACM
15 years 10 months ago
2009
ACM
Miss rate curves (MRCs) are useful in a number of contexts. In our research, online L2 cache MRCs enable us to dynamically identify optimal cache sizes when cache-partitioning a s...
FOCS
2009
IEEE
15 years 4 months ago
2009
IEEE
— In a landmark paper [32], Papadimitriou introduced a number of syntactic subclasses of TFNP based on proof styles that (unlike TFNP) admit complete problems. A recent series of...
ICALP
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. We consider the clustering with diversity problem: given a set of colored points in a metric space, partition them into clusters such that each cluster has at least point...
152
click to vote
SODA
2012
ACM
13 years 4 days 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...
VMCAI
2007
Springer
15 years 3 months ago
2007
Springer
Abstraction frameworks use under-approximating transitions in order to prove existential properties of concrete systems. Under-approximating transifer to the concrete states that c...