3172 search results - page 163 / 635 » On the Random-Self-Reducibility of Complete Sets |
163
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. We provide a complete description of the Wadge hierarchy for deterministically recognizable sets of infinite trees. In particular we give an elementary procedure to decid...
177
click to vote
AMAI
2006
Springer
15 years 6 months ago
2006
Springer
We show that the concepts of strong and uniform equivalence of logic programs eneralized to an abstract algebraic setting of operators on complete lattices. Our results imply char...
163
click to vote
CSJM
2006
15 years 6 months ago
2006
It is known that P systems with two membranes and minimal symport/antiport rules are "almost" computationally complete as generators of number or vector sets. Interpreti...
267
click to vote
SIGMOD
2009
ACM
16 years 6 months ago
2009
ACM
Existing keyword-search systems in relational databases require users to submit a complete query to compute answers. Often users feel "left in the dark" when they have l...
274
click to vote
SIGMOD
2006
ACM
16 years 6 months ago
2006
ACM
Text is ubiquitous and, not surprisingly, many important applications rely on textual data for a variety of tasks. As a notable example, information extraction applications derive...