31 search results - page 5 / 7 » Local algorithms in (weakly) coloured graphs |
SODA
2000
ACM
13 years 10 months ago
2000
ACM
: k-SAT is one of the best known among a wide class of random constraint satisfaction problems believed to exhibit a threshold phenomenon where the control parameter is the ratio, ...
MP
2010
13 years 3 months ago
2010
In many practical applications, the task is to optimize a non-linear objective function over the vertices of a well-studied polytope as, e.g., the matching polytope or the travelli...
SIGMOD
2009
ACM
14 years 8 months ago
2009
ACM
views abstract groups of tasks in a workflow into high level composite tasks, in order to reuse sub-workflows and facilitate provenance analysis. However, unless a view is careful...
UAI
2004
13 years 10 months ago
2004
Generalized belief propagation (GBP) has proven to be a promising technique for approximate inference tasks in AI and machine learning. However, the choice of a good set of cluste...
CIVR
2007
Springer
14 years 2 months ago
2007
Springer
This paper proposes and compares two novel schemes for near duplicate image and video-shot detection. The first approach is based on global hierarchical colour histograms, using ...