504 search results - page 80 / 101 » Canonical Graph Shapes |
BMCBI
2011
13 years 1 months ago
2011
Background: The search for cluster structure in microarray datasets is a base problem for the so-called “-omic sciences”. A difficult problem in clustering is how to handle da...
ERCIMDL
2009
Springer
14 years 4 months ago
2009
Springer
Abstract. The PROBADO project is a research effort to develop Digital Library support for non-textual documents. The main goal is to contribute to all parts of the Digital Library...
KDD
2008
ACM
14 years 10 months ago
2008
ACM
A hypergraph is a generalization of the traditional graph in which the edges are arbitrary non-empty subsets of the vertex set. It has been applied successfully to capture highord...
ICCAD
2002
IEEE
14 years 6 months ago
2002
IEEE
— One of the bottlenecks in the recent movement of hardware synthesis from behavioral C programs is the difficulty in reasoning about runtime pointer values at compile time. The...
AUSDM
2007
Springer
14 years 4 months ago
2007
Springer
Mining frequent patterns such as frequent itemsets is a core operation in many important data mining tasks, such as in association rule mining. Mining frequent itemsets in high-di...