3894 search results - page 589 / 779 » Approximation Algorithms for Biclustering Problems |
208
click to vote
CVPR
2009
IEEE
17 years 1 months ago
2009
IEEE
Graph-based methods form a main category of semisupervised
learning, offering flexibility and easy implementation
in many applications. However, the performance of
these methods...
132
click to vote
ARITH
2007
IEEE
16 years 26 days ago
2007
IEEE
One considers the problem of finding hard to round cases of a periodic function for large floating-point inputs, more precisely when the function cannot be efficiently approxim...
165
click to vote
SSDBM
2007
IEEE
16 years 23 days ago
2007
IEEE
In stream join processing with limited memory, uniform random sampling is useful for approximate query evaluation. In this paper, we address the problem of reservoir sampling over...
160
click to vote
WADS
2005
Springer
15 years 12 months ago
2005
Springer
We study the shortest path problem in weighted polygonal subdivisions of the plane, with the additional constraint of an upper bound, k, on the number of links (segments) in the pa...
173
click to vote
ATAL
2008
Springer
15 years 8 months ago
2008
Springer
In this paper, we deal with the sequential decision making problem of agents operating in computational economies, where there is uncertainty regarding the trustworthiness of serv...