The quest ion of whether concepts expressible as d is junc t ions of conjunct ions can be learned from examples in polynomial t ime is i nves t i ga ted . Pos i t i ve resu l t s are shown fo r s i g n i f i c a n t sub­ classes tha t a l low not only p ropos i t i ona l p re ­ d icates but also some r e l a t i o n s . The algori thms are extended so as to be provably t o l e ran t to a ce r t...

In this year's filtering track, we implemented a system called RELIEFS that tries to learn about the prediction capability of words or conjunctions of words for the relevance of documents. The novelty of the system resides in two main points. First, the features used in the prediction involve both : the implication D->Q (from document to query), and the reverse implication Q->D. This is differe...

BACKGROUND Color and motion serve as the prime examples of segregated processing in the visual brain, giving rise to the question how color-motion conjunctions are represented. This problem is also known as the "binding problem." RESULTS Human volunteers viewed visual displays containing colored dots rotating around the center. The dots could be red or green and rotate clockwise or counterclo...

Remembering complex events requires binding features within unified objects (conjunctions) and holding associations between objects (relations). Recent studies suggest that the two functions dissociate in long-term memory (LTM). Less is known about their functional organization in short-term memory (STM). The present study investigated this issue in patient AE affected by a stroke which caused ...

This article describes the generation of aggregated and elliptic sentences, using Dependency Trees connected by rhetorical relations as input. The system we have developed can generate both hypotactic and paratactic constructions with appropriate cue words, and various forms of ellipsis such as Gapping and Conjunction Reduction. We contend that Dependency Trees connected by rhetorical relations...

We study online learning in Boolean domains using kernels which capture feature expansions equivalent to using conjunctions over basic features. We demonstrate a tradeoff between the computational efficiency with which these kernels can be computed and the generalization ability of the resulting classifier. We first describe several kernel functions which capture either limited forms of conjunc...

This paper explores qoşma, postposition in modern Azeri and its Turkish counterpart. According to the common view on Azeri, postposition, particle, conjunctions, modals, interjection are listed under minor parts of speech. In grammar, there is a tendency categorize all speech single heading edat (particle), which results confusion about definition function particle. Words like particles conjunc...

The design of neural networks that are able to efficiently detect conjunctions of features is an important open challenge. We develop a feed-forward spiking neural network that requires a constant number of neurons for detecting a conjunction irrespective of the size of the retinal input field, and for up to four simultaneously present feature-conjunctions.