Sciweavers

19700 search results - page 3 / 3940
» DNA-Based Computation Times
Sort
View
TC
2002
13 years 5 months ago
The Timely Computing Base Model and Architecture
Abstract-- Current systems are very often based on largescale, unpredictable and unreliable infrastructures. However, users of these systems increasingly require services with time...
Paulo Veríssimo, Antonio Casimiro
EOR
2002
68views more  EOR 2002»
13 years 5 months ago
The computational complexity of the criticality problems in a network with interval activity times
The paper analyzes the criticality in a network with interval activities duration times. A natural generalization of the criticality notion (for a path, an activity and an event) ...
Stefan Chanas, Pawel Zielinski
ASPDAC
2010
ACM
151views Hardware» more  ASPDAC 2010»
13 years 3 months ago
Source-level timing annotation for fast and accurate TLM computation model generation
This paper proposes a source-level timing annotation method for generation of accurate transaction level models for software computation modules. While Transaction Level Modeling ...
Kai-Li Lin, Chen Kang Lo, Ren-Song Tsay
TCOM
2011
108views more  TCOM 2011»
13 years 28 days ago
Computational Complexity of Decoding Orthogonal Space-Time Block Codes
— The computational complexity of optimum decoding for an orthogonal space-time block code is quantified. Four equivalent techniques of optimum decoding which have the same comp...
Ender Ayanoglu, Erik G. Larsson, Eleftherios Karip...
ICASSP
2010
IEEE
13 years 4 months ago
Learning from other subjects helps reducing Brain-Computer Interface calibration time
A major limitation of Brain-Computer Interfaces (BCI) is their long calibration time, as much data from the user must be collected in order to tune the BCI for this target user. I...
Fabien Lotte, Cuntai Guan