507 search results - page 84 / 102 » Computing Sparse Multiples of Polynomials |
122
Voted
TSMC
2008
15 years 2 months ago
2008
This correspondence presents an approach to the detection and isolation of component failures in large-scale systems. In the case of sensors that report at rates of 1 Hz or less, t...
171
Voted
ICMCS
2009
IEEE
15 years 10 days ago
2009
IEEE
In this position paper, we first review the state-of-the-art in graph-based semi-supervised learning, and point out three limitations that are particularly relevant to multimedia ...
209
Voted
CVPR
2010
IEEE
15 years 11 months ago
2010
IEEE
We propose a novel tracking algorithm that can work robustly in a challenging scenario such that several kinds of appearance and motion changes of an object occur at the same time....
125
Voted
FOCS
1991
IEEE
15 years 6 months ago
1991
IEEE
We wish to increase the power of an arbitrary algorithm designed for non-degenerate input, by allowing it to execute on all inputs. We concentrate on in nitesimal symbolic perturba...
129
Voted
IACR
2011
14 years 2 months ago
2011
In this paper, we study the complexity of secure multiparty computation using only the secure arithmetic black-box of a finite field, counting the cost by the number of secure m...