598 search results - page 31 / 120 » Approximation Algorithms for the Bottleneck Stretch Factor P... |
IDA
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. We present a Bayesian treatment of non-negative matrix factorization (NMF), based on a normal likelihood and exponential priors, and derive an efficient Gibbs sampler to ...
PODS
2007
ACM
14 years 8 months ago
2007
ACM
We consider the problem of constructing decision trees for entity identification from a given relational table. The input is a table containing information about a set of entities...
FOCS
2003
IEEE
14 years 1 months ago
2003
IEEE
In this paper, we give the rst constant-factor approximationalgorithmfor the rooted Orienteering problem, as well as a new problem that we call the Discounted-Reward TSP, motivate...
FAW
2010
Springer
13 years 8 months ago
2010
Springer
We study the minimum diameter color-spanning set problem which has recently drawn some attention in the database community. We show that the problem can be solved in polynomial tim...
KDD
2009
ACM
14 years 9 months ago
2009
ACM
We propose two approximation algorithms for identifying communities in dynamic social networks. Communities are intuitively characterized as "unusually densely knit" sub...