397 search results - page 68 / 80 » Towards Polynomial Lower Bounds for Dynamic Problems |
110
click to vote
ICALP
2004
Springer
15 years 5 months ago
2004
Springer
We define a natural notion of efficiency for approximate nearest-neighbor (ANN) search in general n-point metric spaces, namely the existence of a randomized algorithm which answ...
EOR
2006
14 years 11 months ago
2006
This paper considers a project scheduling problem with the objective of minimizing resource availability costs, taking into account a deadline for the project and precedence relat...
103
click to vote
CORR
2002
Springer
14 years 11 months ago
2002
Springer
We examine a computational geometric problem concerning the structure of polymers. We model a polymer as a polygonal chain in three dimensions. Each edge splits the polymer into t...
112
click to vote
ICPADS
2010
IEEE
14 years 9 months ago
2010
IEEE
In this paper, a duty cycle based multi-channel MAC protocol with multiple channel reservation, called M-cube, is proposed to tackle the triple hidden terminal problems. M-cube can...
ICALP
2003
Springer
15 years 5 months ago
2003
Springer
Abstract. In this paper we consider the problem of routing packets in dynamically changing networks, using the anycast mode. In anycasting, a packet may have a set of destinations ...