1647 search results - page 155 / 330 » Improved Randomized Approximation Algorithms for Lot-Sizing ... |
144
click to vote
COCOON
2008
Springer
15 years 6 months ago
2008
Springer
We study the problem of adding k new links to a directed graph G(V, E) in order to maximize the minimum PageRank value for a given subset of the nodes. We show that this problem is...
139
Voted
EDBT
2006
ACM
16 years 5 months ago
2006
ACM
Recent years have seen growing interest in effective algorithms for summarizing and querying massive, high-speed data streams. Randomized sketch synopses provide accurate approxima...
189
click to vote
KDD
2012
ACM
13 years 7 months ago
2012
ACM
We study a novel clustering problem in which the pairwise relations between objects are categorical. This problem can be viewed as clustering the vertices of a graph whose edges a...
140
click to vote
TNN
1998
15 years 4 months ago
1998
— In this work, a probabilistic model is established for recurrent networks. The EM (expectation-maximization) algorithm is then applied to derive a new fast training algorithm f...
147
click to vote
PVLDB
2010
15 years 3 months ago
2010
Uncertain data streams are increasingly common in real-world deployments and monitoring applications require the evaluation of complex queries on such streams. In this paper, we c...