Sciweavers

294 search results - page 10 / 59
» Interaction with the Reorderable Matrix
Sort
View
ICCAD
1999
IEEE
77views Hardware» more  ICCAD 1999»
14 years 22 days ago
Virtual screening: a step towards a sparse partial inductance matrix
We extend the partial inductance concept by replacing the magnetic interaction between open filaments i and j by that between filament j and a (finite) closed loop, formed by conn...
A. J. Dammers, N. P. van der Meijs
TCC
2012
Springer
218views Cryptology» more  TCC 2012»
12 years 4 months ago
Iterative Constructions and Private Data Release
In this paper we study the problem of approximately releasing the cut function of a graph while preserving differential privacy, and give new algorithms (and new analyses of exis...
Anupam Gupta, Aaron Roth, Jonathan Ullman
IPPS
2000
IEEE
14 years 25 days ago
On Optimal Fill-Preserving Orderings of Sparse Matrices for Parallel Cholesky Factorizations
In this paper, we consider the problem of nding llpreserving ordering of a sparse symmetric and positive de nite matrix such that the reordered matrix is suitable for parallel fac...
Wen-Yang Lin, Chuen-Liang Chen
CGF
2010
181views more  CGF 2010»
13 years 7 months ago
Matrix Trees
Recent advances in GPU programmability and architecture have allowed for the generation of ray casted or ray traced images at interactive rates. How quickly these images can be ge...
Nathan Andrysco, Xavier Tricoche
INFORMATICALT
2011
170views more  INFORMATICALT 2011»
13 years 3 months ago
Community Detection Through Optimal Density Contrast of Adjacency Matrix
Detecting communities in real world networks is an important problem for data analysis in science and engineering. By clustering nodes intelligently, a recursive algorithm is desig...
Tianzhu Liang, Kwok Yip Szeto