Sciweavers

15033 search results - page 411 / 3007
» Complexity Theory and Algorithms
Sort
View
ICASSP
2011
IEEE
14 years 11 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
IWOCA
2010
Springer
229views Algorithms» more  IWOCA 2010»
15 years 2 months ago
Ranking and Drawing in Subexponential Time
In this paper we obtain parameterized subexponential-time algorithms for p-Kemeny Aggregation (p-KAGG) -- a problem in social choice theory -- and for p-One-Sided Crossing Minimiza...
Henning Fernau, Fedor V. Fomin, Daniel Lokshtanov,...
CORR
2011
Springer
159views Education» more  CORR 2011»
15 years 2 months ago
Geodesics in CAT(0) Cubical Complexes
We describe an algorithm to compute the geodesics in an arbitrary CAT(0) cubical complex. A key tool is a correspondence between cubical complexes of global non-positive curvature ...
Federico Ardila, Megan Owen, Seth Sullivant
TNN
2008
187views more  TNN 2008»
15 years 7 months ago
Complex ICA by Negentropy Maximization
In this paper, we use complex analytic functions to achieve independent component analysis (ICA) by maximization of non-Gaussianity and introduce the complex maximization of nonGau...
Mike Novey, Tülay Adali
EUROPAR
2007
Springer
16 years 1 months ago
Hirschberg's Algorithm on a GCA and Its Parallel Hardware Implementation
We present in detail a GCA (Global Cellular Automaton) algorithm with 3n cells for Hirschberg’s algorithm which determines the connected components of a n-node undirected graph w...
Johannes Jendrsczok, Rolf Hoffmann, Jörg Kell...