2593 search results - page 93 / 519 » Algorithms and Data Structures for Computer Topology |
141
Voted
PODC
2010
ACM
15 years 4 months ago
2010
ACM
We give a graph decomposition technique that creates entirely independent subproblems for graph problems such as coloring and dominating sets that can be solved without synchroniz...
116
Voted
STACS
2001
Springer
15 years 7 months ago
2001
Springer
The stretch factor of a Euclidean graph is the maximum ratio of the distance in the graph between any two points and their Euclidean distance. Given a set S of n points in Rd, we ...
124
Voted
SIGMETRICS
2005
ACM
15 years 8 months ago
2005
ACM
Statistical information about the flow sizes in the traffic passing through a network link helps a network operator to characterize network resource usage, infer traffic demands,...
101
Voted
ICPR
2002
IEEE
15 years 7 months ago
2002
IEEE
We consider clustering as computation of a structure of proximity relationships within a data set in a feature space or its subspaces. We propose a data structure to represent suc...
206
click to vote
CVPR
2009
IEEE
16 years 9 months ago
2009
IEEE
This paper introduces a new shape matching algorithm for computing correspondences between 3D surfaces that have undergone (approximately) isometric deformations. The new approach ...