92 search results - page 11 / 19 » Fine hierarchies and m-reducibilities in theoretical compute... |
ACSC
2003
IEEE
14 years 21 days ago
2003
IEEE
We introduced a novel method employing a hierarchical domain ontology structure to extract features representing documents in our previous publication (Wang 2002). All raw words i...
ITICSE
2006
ACM
14 years 1 months ago
2006
ACM
Computer graphics concepts have a high visual component. For that reason, teaching this subject should be enriched with the use of small applications showing concepts like near an...
MFCS
2009
Springer
14 years 1 months ago
2009
Springer
Abstract. The parameterized complexity classes of the W -hierarchy are usually defined as the problems reducible to certain natural complete problems by means of fixed-parameter ...
FOCS
2008
IEEE
14 years 1 months ago
2008
IEEE
We show that for k ≥ 3 even the Ω(n) level of the Lasserre hierarchy cannot disprove a random k-CSP instance over any predicate type implied by k-XOR constraints, for example ...
TLCA
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Predicative analysis of recursion schema is a method to characterize complexity classes like the class of polynomial time functions. This analysis comes from the works of...