Sciweavers

5100 search results - page 396 / 1020
» The Linear Complexity of a Graph
Sort
View
PPOPP
2009
ACM
16 years 8 months ago
An efficient transactional memory algorithm for computing minimum spanning forest of sparse graphs
Due to power wall, memory wall, and ILP wall, we are facing the end of ever increasing single-threaded performance. For this reason, multicore and manycore processors are arising ...
Seunghwa Kang, David A. Bader
LCPC
2009
Springer
16 years 5 days ago
Using the Meeting Graph Framework to Minimise Kernel Loop Unrolling for Scheduled Loops
This paper improves our previous research effort [1] by providing an efficient method for kernel loop unrolling minimisation in the case of already scheduled loops, where circular...
Mounira Bachir, David Gregg, Sid Ahmed Ali Touati
LSSC
2005
Springer
16 years 1 months ago
On Weighted Structured Total Least Squares
In this contribution we extend our previous results on the structured total least squares problem to the case of weighted cost functions. It is shown that the computational complex...
Ivan Markovsky, Sabine Van Huffel
NIPS
2003
15 years 9 months ago
Information Dynamics and Emergent Computation in Recurrent Circuits of Spiking Neurons
We employ an efficient method using Bayesian and linear classifiers for analyzing the dynamics of information in high-dimensional states of generic cortical microcircuit models....
Thomas Natschläger, Wolfgang Maass
MP
2006
134views more  MP 2006»
15 years 7 months ago
Cubic regularization of Newton method and its global performance
In this paper, we provide theoretical analysis for a cubic regularization of Newton method as applied to unconstrained minimization problem. For this scheme, we prove general local...
Yurii Nesterov, Boris T. Polyak