1161 search results - page 97 / 233 » Approximation schemes for clustering problems |
117
Voted
WEBI
2009
Springer
15 years 10 months ago
2009
Springer
The World Wide Web has transformed into an environment where users both produce and consume information. In order to judge the validity of information, it is important to know how...
149
click to vote
JMLR
2011
14 years 10 months ago
2011
We consider the problem of improving the Gaussian approximate posterior marginals computed by expectation propagation and the Laplace method in latent Gaussian models and propose ...
126
click to vote
ICDM
2009
IEEE
15 years 10 months ago
2009
IEEE
Given a data matrix, the problem of finding dense/uniform sub-blocks in the matrix is becoming important in several applications. The problem is inherently combinatorial since th...
113
click to vote
ICDM
2009
IEEE
15 years 10 months ago
2009
IEEE
—In graph-based learning models, entities are often represented as vertices in an undirected graph with weighted edges describing the relationships between entities. In many real...
144
Voted
ICPP
2002
IEEE
15 years 8 months ago
2002
IEEE
A cost-effective approach to building up scalable Videoon-Demand (VoD) servers is to couple a number of VoD servers together in a cluster. In this article, we study a crucial vide...