2137 search results - page 95 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
150
click to vote
KDD
2012
ACM
13 years 4 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...
147
click to vote
SMI
2007
IEEE
15 years 8 months ago
2007
IEEE
In this paper, we propose a new algorithm for the fundamental problem of reconstructing surfaces from a large set of unorganized 3D data points. The local shapes of the surface ar...
149
click to vote
IPCO
1998
15 years 3 months ago
1998
Abstract. A well studied and difficult class of scheduling problems concerns parallel machines and precedence constraints. In order to model more realistic situations, we consider ...
133
click to vote
APPROX
2011
Springer
14 years 2 months ago
2011
Springer
Abstract. We study the space complexity of randomized streaming algorithms that provide one-sided approximation guarantees; e.g., the algorithm always returns an overestimate of th...
122
click to vote
IM
2007
15 years 2 months ago
2007
Abstract. In this paper, we consider the problem of calculating fast and accurate approximations to the personalized PageRank score of a webpage. We focus on techniques to improve ...