603 search results - page 102 / 121 » A General Approximation Technique for Constrained Forest Pro... |
191
click to vote
ISPD
2011
ACM
14 years 4 months ago
2011
ACM
Three-dimensional ICs promise to significantly extend the scale of system integration and facilitate new-generation electronics. However, progress in commercial 3D ICs has been s...
141
Voted
MICRO
2002
IEEE
15 years 6 months ago
2002
IEEE
Pre-execution attacks cache misses for which conventional address-prediction driven prefetching is ineffective. In pre-execution, copies of cache miss computations are isolated fr...
150
click to vote
PODS
2005
ACM
16 years 1 months ago
2005
ACM
There is growing interest in algorithms for processing and querying continuous data streams (i.e., data that is seen only once in a fixed order) with limited memory resources. Pro...
103
click to vote
CIKM
2009
Springer
15 years 8 months ago
2009
Springer
In this paper we study approximate landmark-based methods for point-to-point distance estimation in very large networks. These methods involve selecting a subset of nodes as landm...
132
click to vote
CIKM
2010
Springer
15 years 1 days ago
2010
Springer
Computing shortest paths between two given nodes is a fundamental operation over graphs, but known to be nontrivial over large disk-resident instances of graph data. While a numbe...