Sciweavers

1449 search results - page 183 / 290
» Self-Randomized Exponentiation Algorithms
Sort
View
STOC
2002
ACM
103views Algorithms» more  STOC 2002»
16 years 6 months ago
Approximate clustering via core-sets
In this paper, we show that for several clustering problems one can extract a small set of points, so that using those core-sets enable us to perform approximate clustering effici...
Mihai Badoiu, Sariel Har-Peled, Piotr Indyk
ICASSP
2008
IEEE
16 years 24 days ago
Worst- and average-case complexity of LLL lattice reduction in MIMO wireless systems
Lattice reduction by means of the LLL algorithm has been previously suggested as a powerful preprocessing tool that allows to improve the performance of suboptimal detectors and t...
Joakim Jalden, Dominik Seethaler, Gerald Matz
ICDM
2008
IEEE
193views Data Mining» more  ICDM 2008»
16 years 24 days ago
Multiplicative Mixture Models for Overlapping Clustering
The problem of overlapping clustering, where a point is allowed to belong to multiple clusters, is becoming increasingly important in a variety of applications. In this paper, we ...
Qiang Fu, Arindam Banerjee
ISPDC
2008
IEEE
16 years 22 days ago
Computing Equilibria in Bimatrix Games by Parallel Support Enumeration
We consider the problem of computing all Nash equilibria in bimatrix games (i.e., nonzero-sum two-player noncooperative games). Computing all Nash equilibria for large bimatrix ga...
Jonathan Widger, Daniel Grosu
INFOCOM
2007
IEEE
16 years 19 days ago
How Optimal are Wireless Scheduling Protocols?
— In wireless networks mutual interference impairs the quality of received signals and might even prevent the correct reception of messages. It is therefore of paramount importan...
Thomas Moscibroda, Yvonne Anne Oswald, Roger Watte...