Sciweavers

374 search results - page 15 / 75
» Fast separable factorization and applications
Sort
View
SDM
2011
SIAM
414views Data Mining» more  SDM 2011»
14 years 2 months ago
Clustered low rank approximation of graphs in information science applications
In this paper we present a fast and accurate procedure called clustered low rank matrix approximation for massive graphs. The procedure involves a fast clustering of the graph and...
Berkant Savas, Inderjit S. Dhillon
ICPADS
1998
IEEE
15 years 4 months ago
Fast Mutual Exclusion Algorithms Using Read-Modify-Write and Atomic Read/Write Registers
: Three fast mutual exclusion algorithms using read-modify-write and atomic read/write registers are presented in a sequence, with an improvement from one to the next. The last alg...
Ting-Lu Huang
CDC
2009
IEEE
117views Control Systems» more  CDC 2009»
15 years 4 months ago
A limiting property of the matrix exponential with application to multi-loop control
— A limiting property of the matrix exponential is proven: For a real square matrix, where the log norm of the upper-left n by n block approaches negative infinity in a limiting...
Sebastian Trimpe, Raffaello D'Andrea
BILDMED
2008
15 years 1 months ago
Adaptive Threshold Masking
Image bias is a usual phenomenon in MR imaging when using surface coils. It complicates the interpretation as well as the algorithmic postprocessing of such data. We introduce a bi...
Manuel André Gaudnek, Andreas Hess, Klaus O...
FOCS
2008
IEEE
15 years 6 months ago
Fast Modular Composition in any Characteristic
We give an algorithm for modular composition of degree n univariate polynomials over a finite field Fq requiring n1+o(1) log1+o(1) q bit operations; this had earlier been achiev...
Kiran S. Kedlaya, Christopher Umans