Sciweavers

580 search results - page 11 / 116
» On the memory complexity of the forward-backward algorithm
Sort
View
EDBT
2008
ACM
135views Database» more  EDBT 2008»
14 years 7 months ago
Minimizing latency and memory in DSMS: a unified approach to quasi-optimal scheduling
Data Stream Management Systems (DSMSs) must support optimized execution scheduling of multiple continuous queries on massive, and frequently bursty, data streams. Previous approac...
Yijian Bai, Carlo Zaniolo
CORR
2006
Springer
116views Education» more  CORR 2006»
13 years 7 months ago
Memory Aware High-Level Synthesis for Embedded Systems
We introduce a new approach to take into account the memory architecture and the memory mapping in the High- Level Synthesis of Real-Time embedded systems. We formalize the memory...
Gwenolé Corre, Eric Senn, Nathalie Julien, ...
STOC
2004
ACM
129views Algorithms» more  STOC 2004»
14 years 8 months ago
Sorting and searching in the presence of memory faults (without redundancy)
We investigate the design of algorithms resilient to memory faults, i.e., algorithms that, despite the corruption of some memory values during their execution, are able to produce...
Irene Finocchi, Giuseppe F. Italiano
DFT
1999
IEEE
119views VLSI» more  DFT 1999»
13 years 12 months ago
RAMSES: A Fast Memory Fault Simulator
In this paper, we present a memory fault simulator called the Random Access Memory Simulator for Error Screening (RAMSES). Although it was designed based on some wellknown memory ...
Chi-Feng Wu, Chih-Tsun Huang, Cheng-Wen Wu
ICRA
1993
IEEE
101views Robotics» more  ICRA 1993»
13 years 11 months ago
Measuring Complexity of Intelligent Machines
In this paper we introduce a formalism which combines reliability and complexity as performance measures for Intelligent Machines. For a given desired reliability, di erent algori...
Pedro U. Lima, George N. Saridis