3894 search results - page 577 / 779 » Approximation Algorithms for Biclustering Problems |
117
Voted
INFOCOM
2006
IEEE
15 years 9 months ago
2006
IEEE
— Trade-off curves for the exact and the relaxed QoS routing problem are presented and discussed. In addition, an efficient parametric linear programming algorithm to compute th...
162
Voted
FOCS
2004
IEEE
15 years 7 months ago
2004
IEEE
Stochastic optimization problems attempt to model uncertainty in the data by assuming that (part of) the input is specified in terms of a probability distribution. We consider the...
137
Voted
ATAL
2010
Springer
15 years 4 months ago
2010
Springer
In this paper, we study a particular subclass of partially observable models, called quasi-deterministic partially observable Markov decision processes (QDET-POMDPs), characterize...
119
Voted
CORR
2010
Springer
15 years 3 months ago
2010
Springer
Graphs provide an efficient tool for object representation in various computer vision applications. Once graph-based representations are constructed, an important question is how ...
121
click to vote
TON
2008
15 years 3 months ago
2008
Abstract-- In this paper we study the computational complexity and effectiveness of a concept we term "N-hub ShortestPath Routing" in IP networks. N-hub Shortest-Path Rou...