1717 search results - page 70 / 344 » A Computable Spectral Theorem |
160
Voted
IMAGING
2000
15 years 8 months ago
2000
A new spectral representation called the composite model is proposed. Its key point is to decompose all spectra into a smooth background and a collection of spikes. The smooth par...
153
click to vote
EMNLP
2007
15 years 8 months ago
2007
This paper provides an algorithmic framework for learning statistical models involving directed spanning trees, or equivalently non-projective dependency structures. We show how p...
154
click to vote
ECEASST
2010
15 years 1 months ago
2010
Abstract. We present Local Church-Rosser, Parallelism, and Concurrency Theorems for rules with nested application conditions in the framework of weak adhesive HLR categories includ...
216
click to vote
FOCI
2007
IEEE
16 years 1 months ago
2007
IEEE
— We evaluate the average waiting time between observing the price of financial markets and the next price change, especially in an on-line foreign exchange trading service for ...
184
click to vote
JCST
2010
15 years 1 months ago
2010
Probabilistic techniques are widely used in the analysis of algorithms to estimate the computational complexity of algorithms or a computational problem. Traditionally, such analys...