5115 search results - page 554 / 1023 » On Randomized Lanczos Algorithms |
167
click to vote
TSP
2010
15 years 1 months ago
2010
Except in the case of normal (i.e Gaussian) distribution, it is very difficult to calculate the marginal probability distribution of ARMA signals. By using a particular form of mo...
154
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
Many models of wireless sensor networks (WSNs) assume a perfect synchronization along the graph of such network as a simplifying assumption. In our contribution we base our invest...
180
click to vote
ISBRA
2009
Springer
16 years 1 months ago
2009
Springer
Cheng and Church proposed a greedy deletion-addition algorithm to find a given number of k biclusters, whose mean squared residues (MSRs) are below certain thresholds and the miss...
216
click to vote
COCO
2009
Springer
16 years 1 months ago
2009
Springer
A major open question in communication complexity is if randomized and quantum communication are polynomially related for all total functions. So far, no gap larger than a power o...
187
click to vote
CDC
2008
IEEE
16 years 1 months ago
2008
IEEE
— We investigate the effect of packet delays and packet drops on networked control systems. First we consider the problem of where to locate a controller or state estimator in a...