162 search results - page 18 / 33 » A Relational Approach to the Compilation of Sparse Matrix Pr... |
DAC
1999
ACM
16 years 20 days ago
1999
ACM
The many levels of metal used in aggressive deep submicron process technologies has made fast and accurate capacitance extraction of complicated 3-D geometries of conductors essen...
146
click to vote
PLDI
2004
ACM
15 years 5 months ago
2004
ACM
With billion-transistor chips on the horizon, single-chip multiprocessors (CMPs) are likely to become commodity components. Speculative CMPs use hardware to enforce dependence, al...
107
click to vote
AAAI
2010
15 years 1 months ago
2010
With the increasing popularity of location tracking services such as GPS, more and more mobile data are being accumulated. Based on such data, a potentially useful service is to m...
184
click to vote
POPL
2006
ACM
16 years 17 hour ago
2006
ACM
In POPL 2002, Petrank and Rawitz showed a universal result-finding optimal data placement is not only NP-hard but also impossible to approximate within a constant factor if P = NP...
CORR
2011
Springer
14 years 3 months ago
2011
Springer
This paper considers the problem of clustering a partially observed unweighted graph – i.e. one where for some node pairs we know there is an edge between them, for some others ...