1717 search results - page 70 / 344 » A Computable Spectral Theorem |
126
click to vote
IMAGING
2000
15 years 5 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...
125
click to vote
EMNLP
2007
15 years 5 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...
115
click to vote
ECEASST
2010
14 years 11 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...
148
Voted
FOCI
2007
IEEE
15 years 10 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 ...
141
click to vote
JCST
2010
14 years 11 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...