3708 search results - page 86 / 742 » Approximating Betweenness Centrality |
90
Voted
GREC
2005
Springer
15 years 6 months ago
2005
Springer
This paper presents a method of parameterization for online freehand drawing objects based on a piecewise cubic Bezier curve approximation. The target is to represent sketches in a...
114
click to vote
COMPGEOM
2000
ACM
15 years 5 months ago
2000
ACM
We present an (1+ε)-approximation algorithm for computing the minimum-spanning tree of points in a planar arrangement of lines, where the metric is the number of crossings betwee...
90
Voted
CPM
2000
Springer
15 years 5 months ago
2000
Springer
The Maximum Isomorphic Agreement Subtree (MIT) problem is one of the simplest versions of the Maximum Interval Weight Agreement Subtree method (MIWT) which is used to compare phyl...
115
Voted
ECRTS
2004
IEEE
15 years 4 months ago
2004
IEEE
This paper presents a new approach to understand the event stream model. Additionally a new approximation algorithm for the feasibility test of the sporadic and the generalized mu...
109
Voted
SIROCCO
2008
15 years 2 months ago
2008
In this paper, we consider the clustering of resources on large scale platforms. More precisely, we target parallel applications consisting of independant tasks, where each task is...