2137 search results - page 322 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
153
Voted
TAMC
2010
Springer
15 years 10 months ago
2010
Springer
In this paper, we establish the definition of community fundamentally different from what was commonly accepted in previous studies, where communities were typically assumed to ...
125
click to vote
EUROGRAPHICS
2010
Eurographics
16 years 2 months ago
2010
Eurographics
Clothoid splines are gaining popularity as a curve representation due to their intrinsically pleasing curvature, which varies piecewise linearly over arc length. However, construc...
142
click to vote
STOC
2005
ACM
16 years 5 months ago
2005
ACM
We present new explicit constructions of deterministic randomness extractors, dispersers and related objects. We say that a distribution X on binary strings of length n is a -sour...
176
click to vote
COLT
2010
Springer
15 years 2 months ago
2010
Springer
We study graph estimation and density estimation in high dimensions, using a family of density estimators based on forest structured undirected graphical models. For density estim...
166
click to vote
SODA
2003
ACM
15 years 6 months ago
2003
ACM
The natural relaxation for the Group Steiner Tree problem, as well as for its generalization, the Directed Steiner Tree problem, is a flow-based linear programming relaxation. We...