Sciweavers

2701 search results - page 42 / 541
» On the form of witness terms
Sort
View
OTM
2007
Springer
15 years 6 months ago
OntoGame: Towards Overcoming the Incentive Bottleneck in Ontology Building
Despite significant advancement in ontology learning, building ontologies remains a task that highly depends on human intelligence, both as a source of domain expertise and for pro...
Katharina Siorpaes, Martin Hepp
IPL
2007
99views more  IPL 2007»
14 years 11 months ago
Substitutions into propositional tautologies
We prove that there is a polynomial time substitution (y1, . . . , yn) := g(x1, . . . , xk) with k << n such that whenever the substitution instance A(g(x1, . . . , xk)) of ...
Jan Krajícek
IPL
2007
105views more  IPL 2007»
14 years 11 months ago
A new algorithm for testing if a regular language is locally threshold testable
A new algorithm is presented for testing if a regular language is locally threshold testable. The new algorithm is slower than existing algorithms, but its correctness proof is sh...
Mikolaj Bojanczyk
BMCBI
2004
138views more  BMCBI 2004»
14 years 11 months ago
Constraint Logic Programming approach to protein structure prediction
Background: The protein structure prediction problem is one of the most challenging problems in biological sciences. Many approaches have been proposed using database information ...
Alessandro Dal Palù, Agostino Dovier, Feder...
MST
2010
101views more  MST 2010»
14 years 10 months ago
Non-Uniform Reductions
Reductions and completeness notions form the heart of computational complexity theory. Recently non-uniform reductions have been naturally introduced in a variety of settings conc...
Harry Buhrman, Benjamin J. Hescott, Steven Homer, ...