4171 search results - page 770 / 835 » Distributed Data Structure Design for Scientific Computation |
113
Voted
COMPGEOM
1987
ACM
15 years 4 months ago
1987
ACM
Calculating properties of polyhedra given only the set of the locations and neighborhoods of the vertices is easy. Possible properties include volume, surface area, and point cont...
123
click to vote
BMCBI
2006
15 years 20 days ago
2006
The protein-protein interaction networks of even well-studied model organisms are sketchy at best, highlighting the continued need for computational methods to help direct experim...
107
click to vote
ASPLOS
2004
ACM
15 years 6 months ago
2004
ACM
We present a novel processor architecture designed specifically for use in low-power wireless sensor-network nodes. Our sensor network asynchronous processor (SNAP/LE) is based on...
HIPEAC
2007
Springer
15 years 6 months ago
2007
Springer
Computer architects and designers rely heavily on simulation. The downside of simulation is that it is very time-consuming — simulating an industry-standard benchmark on todayâ€...
124
click to vote
ICS
2009
Tsinghua U.
15 years 7 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...