761 search results - page 48 / 153 » Efficient Approximation Algorithms for the Subset-Sums Equal... |
ICML
2003
IEEE
14 years 8 months ago
2003
IEEE
We study the common problem of approximating a target matrix with a matrix of lower rank. We provide a simple and efficient (EM) algorithm for solving weighted low-rank approximat...
AUSAI
2010
Springer
13 years 5 months ago
2010
Springer
We study the problem of clustering uncertain objects whose locations are uncertain and described by probability density functions. We analyze existing pruning algorithms and experi...
CAD
2006
Springer
13 years 7 months ago
2006
Springer
Fat conic section and fat conic spline are defined. With well established properties of fat conic splines, the problem of approximating a ruled surface by a tangent smooth cone sp...
GIS
2006
ACM
14 years 8 months ago
2006
ACM
Moving point object data can be analyzed through the discovery of patterns. We consider the computational efficiency of computing two of the most basic spatio-temporal patterns in...
ECCC
2010
13 years 7 months ago
2010
Assuming the existence of one-way functions, we show that there is no polynomial-time, differentially private algorithm A that takes a database D ({0, 1}d )n and outputs a "...