Sciweavers

13603 search results - page 166 / 2721
» On the Complexity of Computing Treelength
Sort
View
STOC
1996
ACM
197views Algorithms» more  STOC 1996»
15 years 8 months ago
Computing Betti Numbers via Combinatorial Laplacians
We use the Laplacian and power method to compute Betti numbers of simplicial complexes. This has a number of advantages over other methods, both in theory and in practice. It requ...
Joel Friedman
ISSAC
1994
Springer
119views Mathematics» more  ISSAC 1994»
15 years 8 months ago
Branch Cuts in Computer Algebra
Many standard functions, such as the logarithm and square root functions, cannot be de ned continuously on the complex plane. Mistaken assumptions about the properties of these fu...
Adam Dingle, Richard J. Fateman
NIPS
2003
15 years 5 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
CIMAGING
2010
165views Hardware» more  CIMAGING 2010»
15 years 4 months ago
Implementation and evaluation of a penalized alternating minimization algorithm for computational DIC microscopy
We present the implementation and evaluation of a penalized alternating minimization (AM) method1 for the computation of a specimen's complex transmittance function (magnitud...
Chrysanthe Preza, Joseph A. O'Sullivan
ICASSP
2011
IEEE
14 years 8 months ago
Fast algorithms for Iterative Adaptive Approach spectral estimation techniques
This paper presents computationally efficient implementations for Iterative Adaptive Approach (IAA) spectral estimation techniques for uniformly sampled data sets. By exploiting ...
George-Othon Glentis, Andreas Jakobsson