Sciweavers

550 search results - page 65 / 110
» Context Semantics, Linear Logic and Computational Complexity
Sort
View
LOGCOM
2007
59views more  LOGCOM 2007»
14 years 9 months ago
Forgetting Literals with Varying Propositional Symbols
Recently, the old logical notion of forgetting propositional symbols (or reducing the logical vocabulary) has been generalized to a new notion: forgetting literals. The aim was to...
Yves Moinard
DEXA
2006
Springer
193views Database» more  DEXA 2006»
15 years 1 months ago
Understanding and Enhancing the Folding-In Method in Latent Semantic Indexing
Abstract. Latent Semantic Indexing(LSI) has been proved to be effective to capture the semantic structure of document collections. It is widely used in content-based text retrieval...
Xiang Wang 0002, Xiaoming Jin
TRS
2008
14 years 9 months ago
The Neurophysiological Bases of Cognitive Computation Using Rough Set Theory
A popular view is that the brain works in a similar way to a digital computer or a Universal Turing Machine by processing symbols. Psychophysical experiments and our amazing capabi...
Andrzej W. Przybyszewski
DAM
1998
88views more  DAM 1998»
14 years 9 months ago
Neither Reading Few Bits Twice Nor Reading Illegally Helps Much
We first consider so-called (1,+s)-branching programs in which along every consistent path at most s variables are tested more than once. We prove that any such program computing...
Stasys Jukna, Alexander A. Razborov
DOCENG
2006
ACM
15 years 3 months ago
Comparing XML path expressions
XPath is the standard declarative language for navigating XML data and returning a set of matching nodes. In the context of XSLT/XQuery analysis, query optimization, and XML type ...
Pierre Genevès, Nabil Layaïda