Sciweavers

1007 search results - page 62 / 202
» The Complexity of Futile Questioning
Sort
View
CIKM
2008
Springer
15 years 6 months ago
Kernel methods, syntax and semantics for relational text categorization
Previous work on Natural Language Processing for Information Retrieval has shown the inadequateness of semantic and syntactic structures for both document retrieval and categoriza...
Alessandro Moschitti
CSL
2009
Springer
15 years 7 months ago
Fixed-Point Definability and Polynomial Time
My talk will be a survey of recent results about the quest for a logic capturing polynomial time. In a fundamental study of database query languages, Chandra and Harel [4] first ra...
Martin Grohe
ECCC
2000
158views more  ECCC 2000»
15 years 3 months ago
On the Computational Power of Winner-Take-All
This article initiates a rigorous theoretical analysis of the computational power of circuits that employ modules for computing winner-take-all. Computational models that involve ...
Wolfgang Maass
GEOINFORMATICA
1998
144views more  GEOINFORMATICA 1998»
15 years 3 months ago
Approximation-Based Similarity Search for 3-D Surface Segments
The issue of ®nding similar 3-D surface segments arises in many recent applications of spatial database systems, such as molecular biology, medical imaging, CAD, and geographic i...
Hans-Peter Kriegel, Thomas Seidl
GRAMMARS
1998
111views more  GRAMMARS 1998»
15 years 3 months ago
Quantitative Comparison of Languages
From the perspective of the linguist, the theory of formal languages serves as an abstract model to address issues such as complexity, learnability, information content, etc. which...
András Kornai