1632 search results - page 199 / 327 » Sublinear Time Algorithms for Metric Space Problems |
139
click to vote
WCNC
2008
IEEE
15 years 10 months ago
2008
IEEE
—Among all blind channel estimation problems, subspace-based algorithms are attractive due to its fastconverging nature. It primarily exploits the orthogonality structure of the ...
133
click to vote
STOC
2004
ACM
16 years 4 months ago
2004
ACM
We investigate the design of algorithms resilient to memory faults, i.e., algorithms that, despite the corruption of some memory values during their execution, are able to produce...
147
click to vote
CORR
2011
Springer
14 years 8 months ago
2011
Springer
We address the problem of minimizing a convex function over the space of large matrices with low rank. While this optimization problem is hard in general, we propose an efficient...
122
click to vote
ICASSP
2008
IEEE
15 years 10 months ago
2008
IEEE
Classical sampling records the signal level at pre-determined time instances, usually uniformly spaced. An alternative implicit sampling model is to record the timing of pre-deter...
121
click to vote
JCDCG
2004
Springer
15 years 9 months ago
2004
Springer
In this paper we discuss farthest-point problems in which a set or sequence S of n points in the plane is given in advance and can be preprocessed to answer various queries efficie...