Sciweavers

603 search results - page 43 / 121
» Word or Phrase
Sort
View
CSSC
2008
80views more  CSSC 2008»
13 years 7 months ago
Logistic Discrimination with Total Variation Regularization
This article introduces a regularized logistic discrimination method that is especially suited for discretized stochastic processes (such as periodograms, spectrograms, EEG curves...
Robin Rühlicke, Daniel Gervini
APPML
2006
84views more  APPML 2006»
13 years 7 months ago
Approximate deconvolution boundary conditions for large eddy simulation
We introduce new boundary conditions for Large Eddy Simulation. These boundary conditions are based on an approximate deconvolution approach. They are computationally efficient an...
Jeff Borggaard, T. Iliescu
CORR
2006
Springer
69views Education» more  CORR 2006»
13 years 7 months ago
Bounds on the coefficients of the characteristic and minimal polynomials
ABSTRACT. This note presents absolute bounds on the size of the coefficients of the characteristic and minimal polynomials depending on the size of the coefficients of the associat...
Jean-Guillaume Dumas
JACM
2000
119views more  JACM 2000»
13 years 7 months ago
A minimum spanning tree algorithm with Inverse-Ackermann type complexity
A deterministic algorithm for computing a minimum spanning tree of a connected graph is presented. Its running time is O(m (m, n)), where is the classical functional inverse of Ack...
Bernard Chazelle
PE
2000
Springer
101views Optimization» more  PE 2000»
13 years 7 months ago
On the convergence of the power series algorithm
In this paper we study the convergence properties of the power series algorithm, which is a general method to determine (functions of) stationary distributions of Markov chains. W...
Gerard Hooghiemstra, Ger Koole