1736 search results - page 266 / 348 » The rank-width of Directed Graphs |
168
click to vote
BMCBI
2006
15 years 4 months ago
2006
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...
154
click to vote
JAIR
2006
15 years 4 months ago
2006
Fast Downward is a classical planning system based on heuristic search. It can deal with general deterministic planning problems encoded in the propositional fragment of PDDL2.2, ...
126
click to vote
CHI
2008
ACM
16 years 4 months ago
2008
ACM
Collaborative filtering (CF) has been successfully deployed over the years to compute predictions on items based on a user's correlation with a set of peers. The black-box na...
131
click to vote
SODA
2010
ACM
16 years 1 months ago
2010
ACM
We consider the following model for fire containment. We are given an undirected graph G = (V, E) with a source vertex s where the fire starts. At each time step, the firefighters...
147
click to vote
LATIN
2010
Springer
15 years 11 months ago
2010
Springer
Many divide-and-conquer algorithms employ the fact that the vertex set of a graph of bounded treewidth can be separated in two roughly balanced subsets by removing a small subset o...