3874 search results - page 666 / 775 » Approximation Algorithms for k-hurdle Problems |
124
Voted
LATIN
2010
Springer
15 years 8 months ago
2010
Springer
In this paper, we consider Steiner forest and its generalizations, prize-collecting Steiner forest and k-Steiner forest, when the vertices of the input graph are points in the Euc...
128
Voted
INFOCOM
2000
IEEE
15 years 8 months ago
2000
IEEE
— We study wavelength assignment for lightpaths over WDM rings to minimize the SONET ADMs used. This problem has attracted much attention recently. However, its computation compl...
131
click to vote
STACS
1999
Springer
15 years 7 months ago
1999
Springer
Abstract. We advocate to analyze the average complexity of learning problems. An appropriate framework for this purpose is introduced. Based on it we consider the problem of learni...
112
click to vote
ECML
2006
Springer
15 years 7 months ago
2006
Springer
In this paper we formulate the problem of grouping the states of a discrete Markov chain of arbitrary order simultaneously with deconvolving its transition probabilities. As the na...
144
Voted
CAIP
1995
Springer
15 years 7 months ago
1995
Springer
This paper addresses the problem of 3D surface reconstruction using image sequences. It has been shown that shape recovery from three or more occluding contours of the surface is p...