2796 search results - page 357 / 560 » The coolest path problem |
166
click to vote
STACS
2004
Springer
15 years 12 months ago
2004
Springer
OrthogonalVariableSpreadingFactor(OVSF)codesareusedinUMTStosharetheradiospectrum among several connections of possibly different bandwidth requirements. The combinatorial core of t...
155
click to vote
TITB
2002
15 years 6 months ago
2002
This paper reports on technology developments aimed at improving the state of the art for image-guided minimally invasive spine procedures. Back pain is a major health problem with...
186
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
We investigate optimal routing and scheduling strategies for multi-hop wireless networks with rateless codes. Rateless codes allow each node of the network to accumulate mutual in...
189
click to vote
COCO
1998
Springer
15 years 10 months ago
1998
Springer
We show that the perfect matching problem is in the complexity class SPL in the nonuniform setting. This provides a better upper bound on the complexity of the matching problem, a...
163
click to vote
WADS
1997
Springer
15 years 10 months ago
1997
Springer
In this paper we consider the problem of nding a core of limited length in a tree. A core is a path, which minimizes the sum of the distances to all nodes in the tree. This proble...