Sciweavers

103 search results - page 7 / 21
» Direct Algorithms for Computing the Transitive Closure of Da...
Sort
View
IPPS
2002
IEEE
14 years 25 days ago
Optimizing Graph Algorithms for Improved Cache Performance
Tiling has long been used to improve cache performance. Recursion has recently been used as a cache-oblivious method of improving cache performance. Both of these techniques are n...
Joon-Sang Park, Michael Penner, Viktor K. Prasanna
EDBT
2010
ACM
177views Database» more  EDBT 2010»
13 years 10 months ago
PerK: personalized keyword search in relational databases through preferences
Keyword-based search in relational databases allows users to discover relevant information without knowing the database schema or using complicated queries. However, such searches...
Kostas Stefanidis, Marina Drosou, Evaggelia Pitour...
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
ICDE
2008
IEEE
142views Database» more  ICDE 2008»
14 years 9 months ago
An Inflationary Fixed Point Operator in XQuery
ct The backbone of the XML data model, namely ordered, unranked trees, is inherently recursive and it is natural to equip the associated languages with constructs that can query su...
Loredana Afanasiev, Torsten Grust, Maarten Marx, J...
AAAI
2008
13 years 10 months ago
Clustering via Random Walk Hitting Time on Directed Graphs
In this paper, we present a general data clustering algorithm which is based on the asymmetric pairwise measure of Markov random walk hitting time on directed graphs. Unlike tradi...
Mo Chen, Jianzhuang Liu, Xiaoou Tang