3894 search results - page 673 / 779 » Approximation Algorithms for Biclustering Problems |
126
click to vote
INFOCOM
2000
IEEE
15 years 7 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...
130
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...
142
click to vote
CAIP
1995
Springer
15 years 6 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...
123
click to vote
AAAI
2007
15 years 5 months ago
2007
Planning under uncertainty involves two distinct sources of uncertainty: uncertainty about the effects of actions and uncertainty about the current state of the world. The most wi...