Sciweavers

10146 search results - page 340 / 2030
» Fast FAST
Sort
View
WEA
2009
Springer
139views Algorithms» more  WEA 2009»
15 years 11 months ago
Fast Algorithm for Graph Isomorphism Testing
Abstract. In this paper we present a novel approach to the graph isomorphism problem. We combine a direct approach, that tries to find a mapping between the two input graphs using...
José Luis López-Presa, Antonio Fern&...
DATE
2009
IEEE
178views Hardware» more  DATE 2009»
15 years 11 months ago
ORION 2.0: A fast and accurate NoC power and area model for early-stage design space exploration
As industry moves towards many-core chips, networks-on-chip (NoCs) are emerging as the scalable fabric for interconnecting the cores. With power now the first-order design constr...
Andrew B. Kahng, Bin Li, Li-Shiuan Peh, Kambiz Sam...
143
Voted
DDECS
2009
IEEE
128views Hardware» more  DDECS 2009»
15 years 11 months ago
A fast untestability proof for SAT-based ATPG
—Automatic Test Pattern Generation (ATPG) based on Boolean satisfiability (SAT) has been shown to be a beneficial complement to traditional ATPG techniques. Boolean solvers wor...
Daniel Tille, Rolf Drechsler
DSN
2009
IEEE
15 years 11 months ago
Fast memory state synchronization for virtualization-based fault tolerance
Virtualization provides the possibility of whole machine migration and thus enables a new form of fault tolerance that is completely transparent to applications and operating syst...
Maohua Lu, Tzi-cker Chiueh
ICASSP
2009
IEEE
15 years 11 months ago
Subspace tracking of fast time-varying channels in precoded MIMO-OFDM systems
This paper presents a blind subspace-based tracking scheme for precoded MIMO-OFDM systems over rapidly time-varying wireless channels. Subspace-based tracking is normally consider...
Chao-Cheng Tu, Benoît Champagne