Sciweavers

5595 search results - page 842 / 1119
» Approximation Algorithms for Clustering Problems
Sort
View
ICML
2008
IEEE
16 years 7 months ago
Expectation-maximization for sparse and non-negative PCA
We study the problem of finding the dominant eigenvector of the sample covariance matrix, under additional constraints on the vector: a cardinality constraint limits the number of...
Christian D. Sigg, Joachim M. Buhmann
KDD
2008
ACM
243views Data Mining» more  KDD 2008»
16 years 7 months ago
Permu-pattern: discovery of mutable permutation patterns with proximity constraint
Pattern discovery in sequences is an important problem in many applications, especially in computational biology and text mining. However, due to the noisy nature of data, the tra...
Meng Hu, Jiong Yang, Wei Su
AUTONOMICS
2009
ACM
16 years 1 months ago
Sensor Selection for IT Infrastructure Monitoring
Supervisory control is the main means to assure a high level performance and availability of large IT infrastructures. Applied control theory is used in physical and virtualization...
Gergely János Paljak, Imre Kocsis, Zolt&aac...
STOC
2009
ACM
102views Algorithms» more  STOC 2009»
16 years 7 months ago
Multiple intents re-ranking
One of the most fundamental problems in web search is how to re-rank result web pages based on user logs. Most traditional models for re-ranking assume each query has a single int...
Yossi Azar, Iftah Gamzu, Xiaoxin Yin
WWW
2011
ACM
15 years 1 months ago
Limiting the spread of misinformation in social networks
In this work, we study the notion of competing campaigns in a social network. By modeling the spread of influence in the presence of competing campaigns, we provide necessary too...
Ceren Budak, Divyakant Agrawal, Amr El Abbadi