Sciweavers

1279 search results - page 45 / 256
» Fast Implementations of Automata Computations
Sort
View
ITIIS
2008
110views more  ITIIS 2008»
13 years 7 months ago
Fast Detection of Distributed Global Scale Network Attack Symptoms and Patterns in High-speed Backbone Networks
Traditional attack detection schemes based on packets or flows have very high computational complexity. And, network based anomaly detection schemes can reduce the complexity, but...
Sun Ho Kim, Byeong-hee Roh
IPPS
2009
IEEE
14 years 2 months ago
Fast development of dense linear algebra codes on graphics processors
—We present an application programming interface (API) for the C programming language that facilitates the development of dense linear algebra algorithms on graphics processors a...
M. Jesús Zafont, Alberto F. Martín, ...
GD
2001
Springer
14 years 4 days ago
Fast and Simple Horizontal Coordinate Assignment
Abstract. We present a simple, linear-time algorithm to determine horizontal coordinates in layered layouts subject to a given ordering within each layer. The algorithm is easy to ...
Ulrik Brandes, Boris Köpf
ISCAS
1994
IEEE
119views Hardware» more  ISCAS 1994»
13 years 11 months ago
Fast Design Algorithms for FIR Notch Filters
Based on symmetry of the maximally flat frequency response of a FIR notch filter the new design procedure is developed. The closed form solution provides direct computation of the...
Miroslav Vlcek, Ladislav Jires
PVM
2010
Springer
13 years 6 months ago
Toward Performance Models of MPI Implementations for Understanding Application Scaling Issues
Abstract. Designing and tuning parallel applications with MPI, particularly at large scale, requires understanding the performance implications of different choices of algorithms ...
Torsten Hoefler, William Gropp, Rajeev Thakur, Jes...