Sciweavers

2526 search results - page 100 / 506
» A New Algorithm for Answer Set Computation
Sort
View
ICDE
2009
IEEE
145views Database» more  ICDE 2009»
15 years 9 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
VLDB
2007
ACM
125views Database» more  VLDB 2007»
15 years 8 months ago
Data Integration with Uncertainty
This paper reports our first set of results on managing uncertainty in data integration. We posit that data-integration systems need to handle uncertainty at three levels, and do...
Xin Luna Dong, Alon Y. Halevy, Cong Yu
136
Voted
ICDCS
2008
IEEE
15 years 9 months ago
Two-Phased Approximation Algorithms for Minimum CDS in Wireless Ad Hoc Networks
— Connected dominating set (CDS) has a wide range of applications in wireless ad hoc networks. A number of distributed algorithms for constructing a small CDS in wireless ad hoc ...
Peng-Jun Wan, Lixin Wang, F. Frances Yao
133
Voted
BMCBI
2007
145views more  BMCBI 2007»
15 years 2 months ago
Improved benchmarks for computational motif discovery
Background: An important step in annotation of sequenced genomes is the identification of transcription factor binding sites. More than a hundred different computational methods h...
Geir Kjetil Sandve, Osman Abul, Vegard Walseng, Fi...
CORR
2010
Springer
68views Education» more  CORR 2010»
15 years 2 months ago
An Optimization for Reasoning with Forest Logic Programs
Open Answer Set Programming (OASP) is an attractive framework for integrating ontologies and rules. In general OASP is undecidable. In previous work we provided a tableau-based alg...
Cristina Feier, Stijn Heymans