Sciweavers

1279 search results - page 111 / 256
» Fast Implementations of Automata Computations
Sort
View
ICCS
2005
Springer
14 years 3 months ago
Simulating Market Dynamics with CD++
CD++ is an implementation of the Cell-DEVS formalism, which has been used to simulate various complex systems. In this study, we constructed a Cell-DEVS to simulate the dynamics of...
Qi Liu, Gabriel A. Wainer
ISPASS
2009
IEEE
14 years 5 months ago
Evaluating GPUs for network packet signature matching
Modern network devices employ deep packet inspection to enable sophisticated services such as intrusion detection, traffic shaping, and load balancing. At the heart of such servi...
Randy Smith, Neelam Goyal, Justin Ormont, Karthike...
STOC
2009
ACM
271views Algorithms» more  STOC 2009»
14 years 10 months ago
A fast and efficient algorithm for low-rank approximation of a matrix
The low-rank matrix approximation problem involves finding of a rank k version of a m ? n matrix AAA, labeled AAAk, such that AAAk is as "close" as possible to the best ...
Nam H. Nguyen, Thong T. Do, Trac D. Tran
HIPC
2007
Springer
14 years 4 months ago
FFTC: Fastest Fourier Transform for the IBM Cell Broadband Engine
The Fast Fourier Transform (FFT) is of primary importance and a fundamental kernel in many computationally intensive scientific applications. In this paper we investigate its perf...
David A. Bader, Virat Agarwal
SCP
2011
228views Communications» more  SCP 2011»
13 years 5 months ago
Channel-based coordination via constraint satisfaction
Coordination in Reo emerges from the composition of the behavioural constraints of primitives, such as channels, in a component connector. Understanding and implementing Reo, howe...
Dave Clarke, José Proença, Alexander...