1984 search results - page 100 / 397 » The colourful feasibility problem |
APWEB
2003
Springer
14 years 3 months ago
2003
Springer
Abstract. Advances in content-based image retrieval(CBIR)lead to numerous efficient techniques for retrieving images based on their content features, such as colours, textures and ...
CG
2000
Springer
14 years 2 months ago
2000
Springer
This paper proposes a new method for searching two-valued (binary) game trees in games like chess or Go. Lambda-search uses null-moves together with different orders of threat-sequ...
DAGM
2006
Springer
14 years 1 months ago
2006
Springer
Abstract. We propose to tackle the optical flow problem by a combination of two recent advances in the computation of dense correspondences, namely the incorporation of image segme...
LICS
1997
IEEE
14 years 1 months ago
1997
IEEE
We consider a class of infinite two-player games on finitely coloured graphs. Our main question is: given a winning condition, what is the inherent blow-up (additional memory) of ...
BMVC
2002
14 years 15 days ago
2002
A qualitative image description grammar with automatic image fitting and object modelling algorithms is presented. The grammar is based on assigning a square sub-region of an imag...