2600 search results - page 89 / 520 » Clustering with or without the Approximation |
120
click to vote
JMLR
2002
15 years 1 months ago
2002
We apply a variational method to automatically determine the number of mixtures of independent components in high-dimensional datasets, in which the sources may be nonsymmetricall...
186
click to vote
Publication
Several researchers have recently investigated the connection between reinforcement learning and classification. We are motivated by proposals of approximate policy iteration schem...
225
click to vote
WADS
2009
Springer
15 years 8 months ago
2009
Springer
In this paper, we study the two-dimensional geometrical bin packing problem (2DBP): given a list of rectangles, provide a packing of all these into the smallest possible number of ...
102
click to vote
FOCS
2008
IEEE
15 years 8 months ago
2008
IEEE
We give near-optimal sketching and streaming algorithms for estimating Shannon entropy in the most general streaming model, with arbitrary insertions and deletions. This improves ...
130
click to vote
SIBGRAPI
2008
IEEE
15 years 8 months ago
2008
IEEE
This work proposes a simple approximation scheme for discrete data that leads to an infinitely smooth result without global optimization. It combines the flexibility of Binary Sp...