5595 search results - page 679 / 1119 » Approximation Algorithms for Clustering Problems |
201
Voted
ICPP
2005
IEEE
16 years 1 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...
208
click to vote
NIPS
2008
15 years 9 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...
222
click to vote
ICPR
2004
IEEE
16 years 8 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...
179
click to vote
ATAL
2003
Springer
16 years 29 days 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...
204
click to vote
COCOON
1999
Springer
16 years 5 hour ago
1999
Springer
Scheduling jobs with pairwise conflicts is modeled by the graph multicoloring problem. It occurs in two versions: in the preemptive case, each vertex may get any set of colors, w...