2343 search results - page 438 / 469 » Structure and Interpretation of Computer Programs |
110
Voted
ICALP
2003
Springer
15 years 7 months ago
2003
Springer
The (k, r)-center problem asks whether an input graph G has ≤ k vertices (called centers) such that every vertex of G is within distance ≤ r from some center. In this paper we ...
124
click to vote
ICALP
2010
Springer
15 years 7 months ago
2010
Springer
Computing a minimum vertex cover in graphs and hypergraphs is a well-studied optimizaton problem. While intractable in general, it is well known that on bipartite graphs, vertex c...
141
click to vote
ASPLOS
1996
ACM
15 years 6 months ago
1996
ACM
This paper describes Shasta, a system that supports a shared address space in software on clusters of computers with physically distributed memory. A unique aspect of Shasta compa...
145
click to vote
ASPLOS
2010
ACM
15 years 5 months ago
2010
ACM
Power consumption and DRAM latencies are serious concerns in modern chip-multiprocessor (CMP or multi-core) based compute systems. The management of the DRAM row buffer can signif...
165
click to vote
CLA
2007
15 years 4 months ago
2007
In this work we want to discuss an algorithm for drawing line diagrams of lattices based on force directed placement (FDP). This widely used technique in graph drawing introduces f...