Sciweavers

1279 search results - page 65 / 256
» Approximation Algorithms for Min-Max Generalization Problems
Sort
View
KDD
2005
ACM
166views Data Mining» more  KDD 2005»
14 years 9 months ago
A general model for clustering binary data
Clustering is the problem of identifying the distribution of patterns and intrinsic correlations in large data sets by partitioning the data points into similarity classes. This p...
Tao Li
ICPR
2006
IEEE
14 years 10 months ago
Weakly Supervised Learning on Pre-image Problem in Kernel Methods
This paper presents a novel alternative approach, namely weakly supervised learning (WSL), to learn the pre-image of a feature vector in the feature space induced by a kernel. It ...
Weishi Zheng, Jian-Huang Lai, Pong Chi Yuen
MFCS
2005
Springer
14 years 2 months ago
Greedy Approximation via Duality for Packing, Combinatorial Auctions and Routing
We study simple greedy approximation algorithms for general class of integer packing problems. We provide a novel analysis based on the duality theory of linear programming. This e...
Piotr Krysta
BMVC
2010
13 years 6 months ago
Stratified Generalized Procrustes Analysis
This paper deals with generalized procrustes analysis. This is the problem of registering a set of shape data by finding a reference shape and global rigid transformations given p...
Adrien Bartoli, Daniel Pizarro, Marco Loog
INFOCOM
2009
IEEE
14 years 3 months ago
Fast Algorithms and Performance Bounds for Sum Rate Maximization in Wireless Networks
Abstract— Sum rate maximization by power control is an important, challenging, and extensively studied problem in wireless networks. It is a nonconvex optimization problem and ac...
Chee-Wei Tan, Mung Chiang, R. Srikant