When dealing with large amounts of data, exact query answering is not always feasible. We propose a query approximation method that, given an upper bound on the amount of data that can be used (i.e., for which query evaluation is still feasible), identifies a part C of the data D that (i) fits in the available space budget; and (ii) provides accurate query results. That is, for a given query Q,...

We shall discuss several situations in which it is possible to extract from a proof, be it a proof in a first-order theory or a propositional proof, some feasible computational information about the theorem being proved. This includes extracting feasible algorithms, deterministic or interactive, for witnessing an existential quantifier, a uniform family of short propositional proofs of instance...

To understand how simplex solves a general linear programming problem, we need to know the answers to a number of questions: • How to determine if a minimum feasible solution has been found? • Which basic variable should become non-basic at a pivot step? • Which nonbasic variable is to enter the basis at a pivot step? • How to find an initial basic feasible solution to start simplex? We already...

Keywords: Question answering system User generated content Answer quality Question type analysis Hierarchical supervised learning a b s t r a c t In community-based question answering (CQA) services where answers are generated by human, users may expect better answers than an automatic question answering system. However, in some cases, the user generated answers provided by CQA archives are not...