507 search results - page 66 / 102 » Computing Sparse Multiples of Polynomials |
AMW
2010
13 years 9 months ago
2010
In this work we present in-network techniques to improve the efficiency of spatial aggregate queries. Such queries are very common in a sensornet setting, demanding more targeted t...
PAMI
2008
13 years 7 months ago
2008
We propose a geometric approach to 3D motion segmentation from point correspondences in three perspective views. We demonstrate that after applying a polynomial embedding to the po...
CVPR
2011
IEEE
13 years 3 months ago
2011
IEEE
We consider the problem of fitting one or more subspaces to a collection of data points drawn from the subspaces and corrupted by noise/outliers. We pose this problem as a rank m...
FOCS
2007
IEEE
14 years 2 months ago
2007
IEEE
We design a randomized polynomial time algorithm which, given a 3-tensor of real numbers A = {aijk}n i,j,k=1 such that for all i, j, k ∈ {1, . . . , n} we have ai jk = aik j = a...
SIGIR
2006
ACM
14 years 1 months ago
2006
ACM
Large scale learning is often realistic only in a semi-supervised setting where a small set of labeled examples is available together with a large collection of unlabeled data. In...