2498 search results - page 259 / 500 » Algorithms for the Topological Watershed |
164
click to vote
COMPGEOM
2005
ACM
15 years 8 months ago
2005
ACM
In this paper, we bound the difference between the total mean curvatures of two closed surfaces in R3 in terms of their total absolute curvatures and the Fr´echet distance betwee...
144
click to vote
COLING
2008
15 years 7 months ago
2008
This paper presents an approach for substantially reducing the time needed to calculate the shortest paths between all concepts in a wordnet. The algorithm exploits the unique &qu...
127
click to vote
SODA
2004
ACM
15 years 7 months ago
2004
ACM
We study, from the competitive analysis perspective, the trade off between communication cost and delay cost (or simply the sendor-wait dilemma) on a hierarchy (rooted tree). The p...
148
click to vote
FORTE
1998
15 years 7 months ago
1998
Abstract: We present a new algorithm for automatic test generation for multicast routing. Our algorithm processes a nite state machine (FSM) model of the protocol and uses a mix of...
179
click to vote
DC
2010
15 years 6 months ago
2010
Abstract Until now, the analysis of fault tolerance of peerto-peer systems usually only covers random faults of some kind. Contrary to traditional algorithmic research, faults as w...