611 search results - page 75 / 123 » Index Sets of Computable Structures with Decidable Theories |
IFIP
2004
Springer
14 years 2 months ago
2004
Springer
Abstract We propose an alternative notion of asymptotic behaviors for the study of type2 computational complexity. Since the classical asymptotic notion (for all but finitely many...
STOC
2007
ACM
14 years 9 months ago
2007
ACM
We present a polynomial time approximation scheme (PTAS) for the minimum feedback arc set problem on tournaments. A simple weighted generalization gives a PTAS for KemenyYoung ran...
COLCOM
2007
IEEE
14 years 3 months ago
2007
IEEE
—During collaborative writing each author works on a copy of the shared document. These copies are then merged to produce the final document. This asynchronous work is supported...
ICDM
2009
IEEE
13 years 7 months ago
2009
IEEE
The design of a good kernel is fundamental for knowledge discovery from graph-structured data. Existing graph kernels exploit only limited information about the graph structures bu...
DAS
1998
Springer
14 years 1 months ago
1998
Springer
Numerous approaches, including textual, structural and featural, to detecting duplicate documents have been investigated. Considering document images are usually stored and transm...