Sciweavers

2374 search results - page 90 / 475
» Fast Distributed Algorithms for Computing Separable Function...
Sort
View
ALGORITHMICA
2006
86views more  ALGORITHMICA 2006»
14 years 10 months ago
Slabpose Columnsort: A New Oblivious Algorithm for Out-of-Core Sorting on Distributed-Memory Clusters
Our goal is to develop a robust out-of-core sorting program for a distributed-memory cluster. The literature contains two dominant paradigms for out-of-core sorting algorithms: me...
Geeta Chaudhry, Thomas H. Cormen
IJON
2000
76views more  IJON 2000»
14 years 9 months ago
Fast neural network simulations with population density methods
The complexity of neural networks of the brain makes studying these networks through computer simulation challenging. Conventional methods, where one models thousands of individua...
Duane Q. Nykamp, Daniel Tranchina
RT
1998
Springer
15 years 2 months ago
Automatic Calculation of Soft Shadow Textures for Fast, High-Quality Radiosity
We propose a new method for greatly accelerating the computation of complex, detailed shadows in a radiosity solution. Radiosity is computed using a "standard" hierarchi...
Cyril Soler, François X. Sillion
TKDE
2008
152views more  TKDE 2008»
14 years 9 months ago
SRDA: An Efficient Algorithm for Large-Scale Discriminant Analysis
Linear Discriminant Analysis (LDA) has been a popular method for extracting features that preserves class separability. The projection functions of LDA are commonly obtained by max...
Deng Cai, Xiaofei He, Jiawei Han
ICCV
2009
IEEE
14 years 7 months ago
Fast realistic multi-action recognition using mined dense spatio-temporal features
Within the field of action recognition, features and descriptors are often engineered to be sparse and invariant to transformation. While sparsity makes the problem tractable, it ...
Andrew Gilbert, John Illingworth, Richard Bowden