1363 search results - page 75 / 273 » The road coloring problem |
116
click to vote
RSA
2011
14 years 6 months ago
2011
: The classical result in the theory of random graphs, proved by Erd˝os and Rényi in 1960, concerns the threshold for the appearance of the giant component in the random graph pr...
COMPGEOM
2006
ACM
15 years 5 months ago
2006
ACM
In a Batched Colored Intersection Searching Problem (CI), one is given a set of n geometric objects (of a certain class). Each object is colored by one of c colors, and the goal i...
AES
2007
Springer
14 years 12 months ago
2007
Springer
Pattern recognition is an important aspect of a dominant technology such as machine intelligence. Domain specific fuzzy-neuro models particularly for the ‘black box’ implemen...
ICCV
2001
IEEE
16 years 1 months ago
2001
IEEE
The aim of this work is to index images in domain specific databases using colors computed from the object of interest only, instead of the whole image. The main problem in this t...
181
click to vote
AUSSOIS
2001
Springer
15 years 4 months ago
2001
Springer
We discuss fast exponential time solutions for NP-complete problems. We survey known results and approaches, we provide pointers to the literature, and we discuss several open prob...