2621 search results - page 485 / 525 » Near orders and codes |
104
click to vote
CCGRID
2011
IEEE
14 years 1 months ago
2011
IEEE
– Efficient implementations of the Discrete Fourier Transform (DFT) for GPUs provide good performance with large data sizes, but are not competitive with CPU code for small data ...
107
click to vote
PLDI
2011
ACM
14 years 17 days ago
2011
ACM
In this paper we propose Recon, a new general approach to concurrency debugging. Recon goes beyond just detecting bugs, it also presents to the programmer short fragments of buggy...
101
click to vote
EMSOFT
2011
Springer
13 years 9 months ago
2011
Springer
Motivated by improvements in constraint-solving technology and by the increase of routinely available computational power, partial-program synthesis is emerging as an effective a...
119
click to vote
ICALP
2009
Springer
15 years 10 months ago
2009
Springer
We introduce a generic approach for counting subgraphs in a graph. The main idea is to relate counting subgraphs to counting graph homomorphisms. This approach provides new algori...
116
click to vote
BMCBI
2011
14 years 4 months ago
2011
Background: OmniLog™ phenotype microarrays (PMs) have the capability to measure and compare the growth responses of biological samples upon exposure to hundreds of growth condit...