21 search results - page 2 / 5 » On randomly colouring locally sparse graphs |
CORR
2012
Springer
12 years 1 months ago
2012
Springer
A h-uniform hypergraph H = (V, E) is called ( , k)-orientable if there exists an assignment of each hyperedge e ∈ E to exactly of its vertices v ∈ e such that no vertex is ass...
ECCV
2008
Springer
14 years 7 months ago
2008
Springer
Many recent techniques for low-level vision problems such as image denoising are formulated in terms of Markov random field (MRF) or conditional random field (CRF) models. Nonethel...
IJCAI
2003
13 years 6 months ago
2003
Local search algorithms have been very successful for solving constraint satisfaction problems (CSP). However, a major weakness has been that local search is unable to detect unso...
CIKM
2010
Springer
13 years 4 months ago
2010
Springer
In image retrieval, most existing approaches that incorporate local features produce high dimensional vectors, which lead to a high computational and data storage cost. Moreover, ...
SODA
2000
ACM
13 years 6 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, ...