1445 search results - page 168 / 289 » Uniformly Hard Languages |
145
click to vote
CIE
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. If L is a finite relational language then all computable Lstructures can be effectively enumerated in a sequence {An}n∈ω in such a way that for every computable L-st...
136
click to vote
SIGIR
2009
ACM
15 years 10 months ago
2009
ACM
Recent work in supervised learning of term-based retrieval models has shown significantly improved accuracy can often be achieved via better model estimation [2, 10, 11, 17]. In ...
156
click to vote
LICS
2007
IEEE
15 years 10 months ago
2007
IEEE
In predicate logic, the proof that a theorem P holds in a theory Th is typically conducted in natural deduction or in the sequent calculus using all the information contained in t...
155
click to vote
TASE
2007
IEEE
15 years 10 months ago
2007
IEEE
Telco services are evolving under several aspects: for instance, services may combine different telecommunication features (messaging, multi-media, etc.) and may be activated and...
122
click to vote
DBPL
2007
Springer
15 years 10 months ago
2007
Springer
The widespread adoption of XML has led to programming languages that support XML as a first class construct. In this paper, we present a method for analyzing and optimizing impera...