Sciweavers

746 search results - page 15 / 150
» Fast (Structured) Newton Computations
Sort
View
HPCC
2005
Springer
14 years 1 months ago
Fast Sparse Matrix-Vector Multiplication by Exploiting Variable Block Structure
Abstract. We improve the performance of sparse matrix-vector multiplication (SpMV) on modern cache-based superscalar machines when the matrix structure consists of multiple, irregu...
Richard W. Vuduc, Hyun-Jin Moon
ICCAD
1994
IEEE
76views Hardware» more  ICCAD 1994»
13 years 11 months ago
An efficient procedure for the synthesis of fast self-testable controller structures
The BIST implementation of a conventionally synthesized controller in most cases requires the integration of an additional register only for test purposes. This leads to some seri...
Sybille Hellebrand, Hans-Joachim Wunderlich
ESA
2003
Springer
111views Algorithms» more  ESA 2003»
14 years 27 days ago
Fast Smallest-Enclosing-Ball Computation in High Dimensions
Abstract. We develop a simple combinatorial algorithm for computing the smallest enclosing ball of a set of points in high dimensional Euclidean space. The resulting code is in mos...
Kaspar Fischer, Bernd Gärtner, Martin Kutz
DATE
2000
IEEE
93views Hardware» more  DATE 2000»
14 years 3 days ago
Fast Evaluation of Sequence Pair in Block Placement by Longest Common Subsequence Computation
In [1], Murata et al introduced an elegant representation of block placement called sequence pair. All block placement algorithms which are based on sequence pairs use simulated a...
Xiaoping Tang, D. F. Wong, Ruiqi Tian
EDBT
2011
ACM
281views Database» more  EDBT 2011»
12 years 11 months ago
Fast and accurate computation of equi-depth histograms over data streams
Equi-depth histograms represent a fundamental synopsis widely used in both database and data stream applications, as they provide the cornerstone of many techniques such as query ...
Hamid Mousavi, Carlo Zaniolo