Sciweavers

611 search results - page 102 / 123
» Index Sets of Computable Structures with Decidable Theories
Sort
View
ACL
2004
13 years 9 months ago
Balancing Clarity and Efficiency in Typed Feature Logic Through Delaying
The purpose of this paper is to re-examine the balance between clarity and efficiency in HPSG design, with particular reference to the design decisions made in the English Resourc...
Gerald Penn
SIAMCOMP
2000
97views more  SIAMCOMP 2000»
13 years 7 months ago
Complexity of Some Problems Concerning Varieties and Quasi-Varieties of Algebras
In this paper we consider the complexity of several problems involving finite algebraic structures. Given finite algebras A and B, these problems ask the following. (1) Do A and B ...
Clifford Bergman, Giora Slutzki
ICALP
2010
Springer
14 years 21 days ago
A Topological Approach to Recognition
We propose a new approach to the notion of recognition, which departs from the classical definitions by three specific features. First, it does not rely on automata. Secondly, it...
Mai Gehrke, Serge Grigorieff, Jean-Eric Pin
ACMSE
2005
ACM
14 years 1 months ago
The bipartite clique: a topological paradigm for WWWeb user search customization
Web user search customization research has been fueled by the recognition that if the WWW is to attain to its optimal potential as an interactive medium the development of new and...
Brenda F. Miles, Vir V. Phoha
SIGIR
2008
ACM
13 years 7 months ago
Named entity normalization in user generated content
Named entity recognition is important for semantically oriented retrieval tasks, such as question answering, entity retrieval, biomedical retrieval, trend detection, and event and...
Valentin Jijkoun, Mahboob Alam Khalid, Maarten Mar...