3894 search results - page 379 / 779 » Approximation Algorithms for Biclustering Problems |
145
click to vote
CDC
2010
IEEE
15 years 2 days ago
2010
IEEE
We consider the classical finite-state discounted Markovian decision problem, and we introduce a new policy iteration-like algorithm for finding the optimal state costs or Q-facto...
133
click to vote
ESA
2010
Springer
15 years 6 months ago
2010
Springer
In a Content Distribution Network application, we have a set of servers and a set of clients to be connected to the servers. Often there are a few server types and a hard budget co...
155
click to vote
CIKM
2009
Springer
15 years 11 months ago
2009
Springer
Graph data are subject to uncertainties in many applications due to incompleteness and imprecision of data. Mining uncertain graph data is semantically different from and computat...
176
Voted
CORR
2011
Springer
15 years 1 days ago
2011
Springer
This paper introduces a novel algorithm for the nonnegative matrix factorization and completion problem, which aims to find nonnegative matrices X and Y from a subset of entries o...
134
click to vote
ESA
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. Most recent papers addressing the algorithmic problem of allocating advertisement space for keywords in sponsored search auctions assume that pricing is done via a first...