4865 search results - page 517 / 973 » The Complexity of Graph Connectivity |
181
click to vote
RSA
2006
15 years 7 months ago
2006
Abstract. We study two natural models of randomly generated constraint satisfaction problems. We determine how quickly the domain size must grow with n to ensure that these models ...
203
click to vote
FSTTCS
2010
Springer
15 years 5 months ago
2010
Springer
Bisimulation equivalence is decidable in polynomial time over normed graphs generated by a context-free grammar. We present a new algorithm, working in time O(n5 ), thus improving...
196
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
Abstract: We propose a novel probabilistic method for detection of objects in noisy images. The method uses results from percolation and random graph theories. We present an algori...
159
click to vote
ICIP
2003
IEEE
16 years 8 months ago
2003
IEEE
The problem of finding the optimal set of quantized coefficients for a frame-based encoded signal is known to be of very high complexity. This paper presents an efficient method o...
163
click to vote
APPINF
2003
15 years 8 months ago
2003
This paper describes eight requirement indicators derived from a mobile work characterisation framework (MWCF). The MWCF is a framework for analysing mobile scenarios (mobile task...