2498 search results - page 280 / 500 » Data Structures with Unpredictable Timing |
302
click to vote
ICFP
2009
ACM
16 years 7 months ago
2009
ACM
We present a new approach for constructing and verifying higherorder, imperative programs using the Coq proof assistant. We build on the past work on the Ynot system, which is bas...
168
click to vote
CGI
1998
IEEE
15 years 10 months ago
1998
IEEE
Ray tracing and Monte-Carlo based global illumination, as well as radiosity and other finite-element based global illumination methods, all require repeated evaluation of quantita...
146
click to vote
BMCBI
2008
15 years 6 months ago
2008
Background: We consider effects of dependence among variables of high-dimensional data in multiple hypothesis testing problems, in particular the False Discovery Rate (FDR) contro...
180
click to vote
EDBT
2006
ACM
16 years 6 months ago
2006
ACM
Abstract. Sensor networks monitor physical phenomena over large geographic regions. Scientists can gain valuable insight into these phenomena, if they understand the underlying dat...
194
click to vote
PDPTA
2000
15 years 7 months ago
2000
Exploiting compile time knowledge to improve memory bandwidth can produce noticeable improvements at run-time [13, 1]. Allocating the data structure [13] to separate memories when...