Sciweavers

246 search results - page 11 / 50
» Tantra: A Fast PRNG Algorithm and its Implementation
Sort
View
STOC
2009
ACM
271views Algorithms» more  STOC 2009»
14 years 9 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
DATE
2000
IEEE
93views Hardware» more  DATE 2000»
14 years 1 months 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
SIAMSC
2008
117views more  SIAMSC 2008»
13 years 8 months ago
Adaptive, Fast, and Oblivious Convolution in Evolution Equations with Memory
To approximate convolutions which occur in evolution equations with memory terms, a variable-stepsize algorithm is presented for which advancing N steps requires only O(N log N) op...
María López-Fernández, Christ...
CGA
2007
13 years 8 months ago
Fast Simulation of Laplacian Growth
— Laplacian instability is the physical mechanism that drives pattern formation in many disparate natural phenomena. However, current algorithms for simulating this instability a...
Theodore Kim, Jason Sewall, Avneesh Sud, Ming C. L...
JGTOOLS
2006
199views more  JGTOOLS 2006»
13 years 8 months ago
Fast Approximation of High-Order Voronoi Diagrams and Distance Transforms on the GPU
We present a graphics hardware implementation of the tangent-plane algorithm for computing the kth-order Voronoi diagram of a set of point sites in image space. Correct and effici...
Ian Fischer, Craig Gotsman