Sciweavers

413 search results - page 31 / 83
» On the Relation Between ID-Logic and Answer Set Programming
Sort
View
SIGMOD
2004
ACM
163views Database» more  SIGMOD 2004»
14 years 9 months ago
Constraint-Based XML Query Rewriting For Data Integration
We study the problem of answering queries through a target schema, given a set of mappings between one or more source schemas and this target schema, and given that the data is at...
Cong Yu, Lucian Popa
ICDE
2009
IEEE
145views Database» more  ICDE 2009»
14 years 3 months ago
Context-Aware Object Connection Discovery in Large Graphs
— Given a large graph and a set of objects, the task of object connection discovery is to find a subgraph that retains the best connection between the objects. Object connection...
James Cheng, Yiping Ke, Wilfred Ng, Jeffrey Xu Yu
ICALP
1992
Springer
14 years 28 days ago
On Nearest-Neighbor Graphs
The "nearest neighbor" relation, or more generally the "k nearest neighbors" relation, defined for a set of points in a metric space, has found many uses in co...
Mike Paterson, F. Frances Yao
ACL
2010
13 years 6 months ago
Global Learning of Focused Entailment Graphs
We propose a global algorithm for learning entailment relations between predicates. We define a graph structure over predicates that represents entailment relations as directed ed...
Jonathan Berant, Ido Dagan, Jacob Goldberger
BMCBI
2005
152views more  BMCBI 2005»
13 years 8 months ago
CoPub Mapper: mining MEDLINE based on search term co-publication
Background: High throughput microarray analyses result in many differentially expressed genes that are potentially responsible for the biological process of interest. In order to ...
Blaise T. F. Alako, Antoine Veldhoven, Sjozef van ...