725 search results - page 56 / 145 » A General Greedy Approximation Algorithm with Applications |
113
click to vote
TNN
2010
14 years 4 months ago
2010
Finite mixture model is a powerful tool in many statistical learning problems. In this paper, we propose a general, structure-preserving approach to reduce its model complexity, w...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
`Approximate message passing' algorithms proved to be extremely effective in reconstructing sparse signals from a small number of incoherent linear measurements. Extensive num...
SODA
1998
ACM
14 years 11 months ago
1998
ACM
Given an undirected graph with nonnegative costs on the edges, the routing cost of any of its spanning trees is the sum over all pairs of vertices of the cost of the path between t...
COMPGEOM
2004
ACM
15 years 3 months ago
2004
ACM
We consider the problem of approximate range counting over streams of d-dimensional points. In the data stream model, the algorithm makes a single scan of the data, which is prese...
KDD
2006
ACM
15 years 10 months ago
2006
ACM
Partitions of sequential data exist either per se or as a result of sequence segmentation algorithms. It is often the case that the same timeline is partitioned in many different ...