10805 search results - page 216 / 2161 » Mapping Computation with No Memory |
170
click to vote
CG
2004
Springer
15 years 6 months ago
2004
Springer
nd maps are powerful abstractions. Their combination, Hierarchical Graph Maps, provide effective tools to process a graph that is too large to fit on the screen. They provide hier...
176
click to vote
IPPS
2003
IEEE
15 years 12 months ago
2003
IEEE
The accurate modeling of the electronic structure of atoms and molecules involves computationally intensive tensor contractions involving large multi-dimensional arrays. The effi...
205
click to vote
IJCNN
2000
IEEE
15 years 11 months ago
2000
IEEE
eresting web-available abstracts and papers on clustering: An Analysis of Recent Work on Clustering Algorithms (1999), Daniel Fasulo : This paper describes four recent papers on cl...
188
click to vote
BMCBI
2008
15 years 6 months ago
2008
Background: High-throughput genotyping technology has enabled cost effective typing of thousands of individuals in hundred of thousands of markers for use in genome wide studies. ...
166
click to vote
HPCA
2012
IEEE
14 years 2 months ago
2012
IEEE
Recent research on memory disaggregation introduces a new architectural building block—the memory blade—as a cost-effective approach for memory capacity expansion and sharing ...