Sciweavers

280 search results - page 44 / 56
» New Algorithms for Enumerating All Maximal Cliques
Sort
View
FITRAMEN
2008
14 years 11 months ago
A Fair and Dynamic Load-Balancing Mechanism
The current data network scenario makes Traffic Engineering (TE) a very challenging task. The ever growing access rates and new applications running on end-hosts result in more var...
Federico Larroca, Jean-Louis Rougier
AAAI
1998
14 years 10 months ago
Learning to Classify Text from Labeled and Unlabeled Documents
In many important text classification problems, acquiring class labels for training documents is costly, while gathering large quantities of unlabeled data is cheap. This paper sh...
Kamal Nigam, Andrew McCallum, Sebastian Thrun, Tom...
CORR
2007
Springer
167views Education» more  CORR 2007»
14 years 9 months ago
Optimal Solutions for Sparse Principal Component Analysis
Given a sample covariance matrix, we examine the problem of maximizing the variance explained by a linear combination of the input variables while constraining the number of nonze...
Alexandre d'Aspremont, Francis R. Bach, Laurent El...
SDM
2010
SIAM
129views Data Mining» more  SDM 2010»
14 years 7 months ago
Cross-Selling Optimization for Customized Promotion
The profit of a retail product not only comes from its own sales, but also comes from its influence on the sales of other products. How to promote the right products to the righ...
Nan Li, Yinghui Yang, Xifeng Yan
CVPR
2011
IEEE
14 years 1 months ago
Entropy Rate Superpixel Segmentation
We propose a new objective function for superpixel segmentation. This objective function consists of two components: entropy rate of a random walk on a graph and a balancing term....
Ming-Yu Liu, Oncel Tuzel, Srikumar Ramalingam, Ram...