Sciweavers

6542 search results - page 170 / 1309
» The tao of parallelism in algorithms
Sort
View
ICDM
2008
IEEE
122views Data Mining» more  ICDM 2008»
16 years 1 months ago
Nonnegative Matrix Factorization for Combinatorial Optimization: Spectral Clustering, Graph Matching, and Clique Finding
Nonnegative matrix factorization (NMF) is a versatile model for data clustering. In this paper, we propose several NMF inspired algorithms to solve different data mining problems....
Chris H. Q. Ding, Tao Li, Michael I. Jordan
JMLR
2006
107views more  JMLR 2006»
15 years 6 months ago
Consistency of Multiclass Empirical Risk Minimization Methods Based on Convex Loss
The consistency of classification algorithm plays a central role in statistical learning theory. A consistent algorithm guarantees us that taking more samples essentially suffices...
Di-Rong Chen, Tao Sun
WIOPT
2010
IEEE
15 years 4 months ago
Iterative power and subcarrier allocation for maximizing WSMR in cellular OFDMA systems
We consider the resource allocation (RA) problem of maximizing the weighted sum of the minimal user rates (WSMR) of coordinated cells subject to a total power constraint at each ba...
Tao Wang, Luc Vandendorpe
ICASSP
2011
IEEE
14 years 10 months ago
Efficient convex optimization for real-time robust beamforming with microphone arrays
This paper presents an efficient implementation of a robust adaptive beamforming algorithm based on convex optimization for applications in the processing-constrained environment...
Eric A. Durant, Ivo Merks, Bill Woods, Jinjun Xiao...
SSD
1993
Springer
91views Database» more  SSD 1993»
15 years 10 months ago
Volumes From Overlaying 3-D Triangulations in Parallel
Consider a polyhedron that is triangulated into tetrahedra in two different ways. This paper presents an algorithm, and hints for implementation, for finding the volumes of the i...
Wm. Randolph Franklin, Mohan S. Kankanhalli