3894 search results - page 444 / 779 » Approximation Algorithms for Biclustering Problems |
135
click to vote
APPROX
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. We are interested in efficient algorithms for generating random samples from geometric objects such as Riemannian manifolds. As a step in this direction, we consider the ...
131
click to vote
ICPP
2005
IEEE
15 years 10 months ago
2005
IEEE
We consider the filter decomposition problem in supporting coarse-grained pipelined parallelism. This form of parallelism is suitable for data-driven applications in scenarios wh...
143
click to vote
NIPS
2008
15 years 6 months ago
2008
We consider the problem of obtaining the approximate maximum a posteriori estimate of a discrete random field characterized by pairwise potentials that form a truncated convex mod...
162
click to vote
ICPR
2004
IEEE
16 years 5 months ago
2004
IEEE
In this paper novel theory to automate shape modelling is described. The main idea is to develop a theory that is intrinsically defined for curves, as opposed to a finite sample o...
126
click to vote
ATAL
2003
Springer
15 years 10 months ago
2003
Springer
In complex distributed applications, a problem is often decomposed into a set of subproblems that are distributed to multiple agents. We formulate this class of problems with a tw...