Sciweavers

6365 search results - page 120 / 1273
» Fast Local Computation Algorithms
Sort
View
ESANN
2006
15 years 6 months ago
An algorithm for fast and reliable ESOM learning
The training of Emergent Self-organizing Maps (ESOM ) with large datasets can be a computationally demanding task. Batch learning may be used to speed up training. It is demonstrat...
Mario Nöcker, Fabian Mörchen, Alfred Ult...
SDM
2009
SIAM
162views Data Mining» more  SDM 2009»
16 years 1 months ago
Link Propagation: A Fast Semi-supervised Learning Algorithm for Link Prediction.
We propose Link Propagation as a new semi-supervised learning method for link prediction problems, where the task is to predict unknown parts of the network structure by using aux...
Hisashi Kashima, Tsuyoshi Kato, Yoshihiro Yamanish...
ISBI
2009
IEEE
15 years 11 months ago
Fast Algorithms for Nonconvex Compressive Sensing: MRI Reconstruction from Very Few Data
Compressive sensing is the reconstruction of sparse images or signals from very few samples, by means of solving a tractable optimization problem. In the context of MRI, this can ...
Rick Chartrand
153
Voted
VLSID
2006
IEEE
143views VLSI» more  VLSID 2006»
15 years 10 months ago
Frame Based Fair Multiprocessor Scheduler: A Fast Fair Algorithm for Real-Time Embedded Systems
This paper presents Frame Based Fair Multiprocessor Scheduler (FBFMS) which provides accurate real-time proportional fair scheduling for a set of dynamic tasks on a symmetric mult...
Arnab Sarkar, P. P. Chakrabarti, Rajeev Kumar
DAC
1999
ACM
16 years 5 months ago
Graph Coloring Algorithms for Fast Evaluation of Curtis Decompositions
Finding the minimum column multiplicity for a bound set of variables is an important problem in Curtis decomposition. To investigate this problem, we compared two graphcoloring pr...
Marek A. Perkowski, Rahul Malvi, Stan Grygiel, Mic...