606 search results - page 91 / 122 » Answer Diversification for Complex Question Answering on the... |
88
Voted
CORR
2004
Springer
15 years 1 months ago
2004
Springer
While most polynomial Julia sets are computable, it has been recently shown [12] that there exist non-computable Julia sets. The proof was non-constructive, and indeed there were ...
131
click to vote
ECCC
2010
15 years 15 days ago
2010
Parameterized Resolution and, moreover, a general framework for parameterized proof complexity was introduced by Dantchev, Martin, and Szeider [16] (FOCS’07). In that paper, Dan...
146
click to vote
TLSDKCS
2010
14 years 8 months ago
2010
Abstract. With increasing volumes of data, much effort has been devoted to finding the most suitable answer to an information need. However, in many domains, the question whether a...
140
click to vote
COMPGEOM
2011
ACM
14 years 5 months ago
2011
ACM
We consider the offset-deconstruction problem: Given a polygonal shape Q with n vertices, can it be expressed, up to a tolerance ε in Hausdorff distance, as the Minkowski sum o...
134
click to vote
PVLDB
2008
15 years 1 months ago
2008
The number of potentially-related data resources available for querying -- databases, data warehouses, virtual integrated schemas -continues to grow rapidly. Perhaps no area has s...