1652 search results - page 67 / 331 » Power Iteration Clustering |
140
Voted
OSDI
1994
ACM
15 years 5 months ago
1994
ACM
A fine-grain parallel program is one in which processes are typically small, ranging from a few to a few hundred instructions. Fine-grain parallelism arises naturally in many situ...
122
click to vote
NIPS
2004
15 years 5 months ago
2004
In this paper we propose an efficient algorithm for reducing a large mixture of Gaussians into a smaller mixture while still preserving the component structure of the original mod...
132
click to vote
NIPS
2003
15 years 5 months ago
2003
We argue that K–means and deterministic annealing algorithms for geometric clustering can be derived from the more general Information Bottleneck approach. If we cluster the ide...
129
click to vote
FUIN
2010
15 years 1 months ago
2010
Some distributed constraint optimization algorithms use a linear number of messages in the number of agents, but of exponential size. This is often the main limitation for their pr...
110
click to vote
WCNC
2008
IEEE
15 years 10 months ago
2008
IEEE
— In this paper, we present a novel algorithm for reducing sidelobe interference power levels in OFDM-based cognitive radios. Existing techniques for sidelobe suppression can be ...