272 search results - page 50 / 55 » An Approximation Algorithm for a Bottleneck Traveling Salesm... |
INFOCOM
2005
IEEE
14 years 28 days ago
2005
IEEE
— Providing approximate max-min fair bandwidth allocation among flows within a network or at a single router has been an important research problem. In this paper, we study the ...
MIR
2006
ACM
14 years 1 months ago
2006
ACM
We present a technique for combining audio signal-based music similarity with web-based musical artist similarity to accelerate the task of automatic playlist generation. We demon...
COSIT
1995
Springer
13 years 11 months ago
1995
Springer
: Various algorithms have been proposed for the determination of the optimum paths in line networks. Moving in space is a far more complex problem, where research has been scarce. ...
ADHOCNOW
2010
Springer
13 years 5 months ago
2010
Springer
A set of sensors establishes barrier coverage of a given line segment if every point of the segment is within the sensing range of a sensor. Given a line segment I, n mobile sensor...
COMPGEOM
2005
ACM
13 years 9 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...