Sciweavers

2570 search results - page 114 / 514
» Fast Algorithms For The Computation Of Ranklets
Sort
View
GD
2006
Springer
15 years 1 months ago
SSDE: Fast Graph Drawing Using Sampled Spectral Distance Embedding
Abstract. We present a fast spectral graph drawing algorithm for drawing undirected connected graphs. Classical Multi-Dimensional Scaling yields a quadratictime spectral algorithm,...
Ali Civril, Malik Magdon-Ismail, Eli Bocek-Rivele
95
Voted
EGH
2010
Springer
14 years 8 months ago
GPU random numbers via the tiny encryption algorithm
Random numbers are extensively used on the GPU. As more computation is ported to the GPU, it can no longer be treated as rendering hardware alone. Random number generators (RNG) a...
Fahad Zafar, Marc Olano, Aaron Curtis
COMPUTING
2002
57views more  COMPUTING 2002»
14 years 10 months ago
Problem Dependent Generalized Prewavelets
In this paper, we present a new approach to construct robust multilevel algorithms for elliptic differential equations. The multilevel algorithms consist of multiplicative subspac...
Christoph Pflaum
ICIP
2002
IEEE
15 years 11 months ago
Fast text/graphics resolution improvement using wavelet based denoising and chain-code table lookup
We propose a fast text/graphics resolution improvement algorithm with boundary parameterization and wavelet based denoising. Given input images containing labeled text/graphics ob...
Onur G. Guleryuz, Anoop Bhattacharjya
73
Voted
ESA
2006
Springer
105views Algorithms» more  ESA 2006»
15 years 1 months ago
Dynamic Programming and Fast Matrix Multiplication
Abstract. We give a novel general approach for solving NP-hard optimization problems that combines dynamic programming and fast matrix multiplication. The technique is based on red...
Frederic Dorn