Sciweavers

606 search results - page 106 / 122
» Answer Diversification for Complex Question Answering on the...
Sort
View
106
Voted
ECCC
2010
117views more  ECCC 2010»
14 years 10 months ago
Nearly Tight Bounds for Testing Function Isomorphism
We study the problem of testing isomorphism (equivalence up to relabelling of the variables) of two Boolean functions f, g : {0, 1}n → {0, 1}. Our main focus is on the most stud...
Sourav Chakraborty, David García-Soriano, A...
SAT
2007
Springer
118views Hardware» more  SAT 2007»
15 years 5 months ago
Improved Lower Bounds for Tree-Like Resolution over Linear Inequalities
Abstract. We continue a study initiated by Kraj´ıˇcek of a Resolutionlike proof system working with clauses of linear inequalities, R(CP). For all proof systems of this kind Kra...
Arist Kojevnikov
LCC
1994
248views Algorithms» more  LCC 1994»
15 years 3 months ago
Comparing the Power of Monadic NP Games
The descriptive complexity of a problem is the complexity of describing the problem in some logical formalism. One of the few techniques for proving separation results in descripti...
Ronald Fagin
126
Voted
PODS
1995
ACM
139views Database» more  PODS 1995»
15 years 3 months ago
Normalizing Incomplete Databases
Databases are often incomplete because of the presence of disjunctive information, due to con icts, partial knowledge and other reasons. Queries against such databases often ask q...
Leonid Libkin
VIS
2004
IEEE
204views Visualization» more  VIS 2004»
16 years 27 days ago
Exploration of the Brain's White Matter Pathways with Dynamic Queries
Diffusion Tensor Imaging (DTI) is a magnetic resonance imaging method that can be used to measure local information about the structure of white matter within the human brain. Com...
David Akers, Anthony Sherbondy, Rachel Mackenzie, ...