Sciweavers

58 search results - page 10 / 12
» On Finding Acyclic Subhypergraphs
Sort
View
CORR
2010
Springer
154views Education» more  CORR 2010»
13 years 7 months ago
Causal Markov condition for submodular information measures
The causal Markov condition (CMC) is a postulate that links observations to causality. It describes the conditional independences among the observations that are entailed by a cau...
Bastian Steudel, Dominik Janzing, Bernhard Sch&oum...
ICALP
2009
Springer
14 years 7 months ago
Algorithms for Secretary Problems on Graphs and Hypergraphs
We examine several online matching problems, with applications to Internet advertising reservation systems. Consider an edge-weighted bipartite graph G, with partite sets L, R. We...
Martin Pál, Nitish Korula
BMCBI
2006
147views more  BMCBI 2006»
13 years 7 months ago
Grouping Gene Ontology terms to improve the assessment of gene set enrichment in microarray data
Background: Gene Ontology (GO) terms are often used to assess the results of microarray experiments. The most common way to do this is to perform Fisher's exact tests to find...
Alex Lewin, Ian C. Grieve
SIGMOD
2009
ACM
182views Database» more  SIGMOD 2009»
14 years 7 months ago
3-HOP: a high-compression indexing scheme for reachability query
Reachability queries on large directed graphs have attracted much attention recently. The existing work either uses spanning structures, such as chains or trees, to compress the c...
Ruoming Jin, Yang Xiang, Ning Ruan, David Fuhry
CIKM
2007
Springer
14 years 1 months ago
Evaluation of partial path queries on xml data
XML query languages typically allow the specification of structural patterns of elements. Finding the occurrences of such patterns in an XML tree is the key operation in XML quer...
Stefanos Souldatos, Xiaoying Wu, Dimitri Theodorat...