232 search results - page 3 / 47 » On Characterizing the Data Access Complexity of Programs |
ICC
2000
IEEE
13 years 9 months ago
2000
IEEE
— This paper proposes a numerical method for characterizing the achievable rate region for a Gaussian multiple access channel with ISI under the frequency division multiple acces...
SC
1995
ACM
13 years 8 months ago
1995
ACM
Given the large communication overheads characteristic of modern parallel machines, optimizations that eliminate, hide or parallelize communication may improve the performance of ...
DLOG
2006
13 years 6 months ago
2006
The novel context of accessing and querying large data repositories through ontologies that are formalized in terms of expressive DLs requires on the one hand to consider query an...
KBSE
2007
IEEE
13 years 11 months ago
2007
IEEE
Programmers have long used assertions to characterize properties of code. An assertion violation signals a corruption in the program state. At such a state, it is standard to term...
IMAGING
2004
13 years 6 months ago
2004
In this study, the problem of updating a printer characterization in response to systematic changes in print-device characteristics is addressed with two distinct approaches: the ...