146 search results - page 18 / 30 » Computably Enumerable Sets and Quasi-Reducibility |
CVPR
2006
IEEE
15 years 28 days ago
2006
IEEE
Flat appearance-based systems, which combine clever image representations with standard classifiers, might be the most effective way to recognize objects using current technologie...
GPCE
2008
Springer
13 years 12 months ago
2008
Springer
High-level query constructs help greatly improve the clarity of programs and the productivity of programmers, and are being introduced to increasingly more languages. However, the...
APAL
2006
13 years 11 months ago
2006
We investigate effective categoricity of computable equivalence structures A. We show that A is computably categorical if and only if A has only finitely many finite equivalence c...
TCS
2010
13 years 9 months ago
2010
In a left-forbidding grammar, a set of nonterminals is attached to every context-free production, and such a production can rewrite a nonterminal if no symbol from the attached se...
WWW
2009
ACM
14 years 11 months ago
2009
ACM
In this paper we describe a problem of discovering query clusters from a click-through graph of web search logs. The graph consists of a set of web search queries, a set of pages ...