The neural substrates of feature binding are an old, yet still not completely resolved problem. While patient studies suggest that posterior parietal cortex is necessary for feature binding, imaging evidence has been inconclusive in the past. These studies compared visual feature and conjunction search to investigate the neural substrate of feature conjunctions. However, a common problem of the...

Heuristic search is one of the most successful approaches to classical planning, finding solution paths in large state spaces. A major focus has been the development of domainindependent heuristic functions. One recent method are partial delete relaxation heuristics, improving over the standard delete relaxation heuristic through imposing a set C of conjunctions to be treated as atomic. Practic...

We present neuropsychological evidence demonstrating that the binding of form elements into shapes dissociates from the binding of surface detail to shape. Data are reported from a patient with bilateral parietal lesions, GK, who manifests left-side visual extinction along with many illusory conjunctions when asked to discriminate both surface and form information about stimuli. We show that th...

Was the Commynes’s syntactic cohesion (a man “not literary”, father of genre memoirs and diplomat fifteenth century which syntax has been often described as paratactic or uncohesive) influenced, according to received idea, by his habit diplomatic despatch was she perceived uncohesive contemporaries? To answer questions, respectively, we compare lack Memoirs with those autograph letters then sea...

When presented with a red T and a green O, observers occasionally make conjunction responses and indicate that they saw a green T. These errors have been interpreted as reflecting separable processing stages of feature detection and integration with the illusory conjunctions arising from a failure at the integration stage. Recently, M. Donk (1999) asserted that the phenomenon of illusory conjun...

This paper presents a new generic filtering algorithm which simultaneously considers n conjunctions of constraints as well as those constraints mentioning some variables Yk of the pairs X,Yk (1≤k≤n) occurring in these conjunctions. The main benefit of this new technique comes from the fact that, for adjusting the bounds of a variable X according to n conjunctions, we do not perform n sweeps in ...