5595 search results - page 707 / 1119 » Approximation Algorithms for Clustering Problems |
211
click to vote
DATAMINE
2010
15 years 7 months ago
2010
We address the combinatorial optimization problem of finding the most influential nodes on a large-scale social network for two widely-used fundamental stochastic diffusion models...
175
click to vote
FSTTCS
2010
Springer
15 years 4 months ago
2010
Springer
ABSTRACT. The maximum independent set problem (MAXIS) on general graphs is known to be NPhard to approximate within a factor of n1-, for any > 0. However, there are many "...
190
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
Traditional binary hypothesis testing relies on the precise knowledge of the probability density of an observed random vector conditioned on each hypothesis. However, for many app...
166
click to vote
TIT
1998
15 years 6 months ago
1998
—The emergent role of information theory in image formation is surveyed. Unlike the subject of information-theoretic communication theory, information-theoretic imaging is far fr...
179
click to vote
ALENEX
2009
15 years 4 months ago
2009
We consider the problem of finding a ranking of a set of elements that is "closest to" a given set of input rankings of the elements; more precisely, we want to find a p...