Sciweavers

2498 search results - page 172 / 500
» Algorithms for the Topological Watershed
Sort
View
SIAMJO
2000
101views more  SIAMJO 2000»
15 years 6 months ago
An Efficient Algorithm for Minimizing a Sum of p-Norms
We study the problem of minimizing a sum of p-norms where p is a fixed real number in the interval [1, ]. Several practical algorithms have been proposed to solve this problem. How...
Guoliang Xue, Yinyu Ye
IEEEHPCS
2010
15 years 5 months ago
An experimental study of greedy routing algorithms
The “small world” phenomenon, i.e., the fact that the global social network is strongly connected in the sense that every two persons are inter-related through a small chain o...
Stavros Athanassopoulos, Christos Kaklamanis, Ilia...
ICANNGA
2009
Springer
130views Algorithms» more  ICANNGA 2009»
16 years 1 months ago
String Distances and Uniformities
Abstract. The Levenstein or edit distance was developed as a metric for calculating distances between character strings. We are looking at weighting the different edit operations (...
David W. Pearson, Jean-Christophe Janodet
ICWMC
2006
IEEE
16 years 17 days ago
Field Trials with Wireless Sensor Networks: Issues and Remedies
Extensive field trials are essential to evaluate protocols and algorithms for wireless sensor networks. The high costs of such trials demand for a systematic approach. This paper...
Volker Turau, Matthias Witt, Marcus Venzke
CGI
2004
IEEE
15 years 10 months ago
Computing Polygonal Surfaces from Unions of Balls
We present a new algorithm for computing a polygonal surface from a union of balls. The method computes and connects the singular points of a given union of balls in an efficient ...
Roger C. Tam, Wolfgang Heidrich