Sciweavers

175 search results - page 11 / 35
» max-cut and Containment Relations in Graphs
Sort
View
BMCBI
2008
173views more  BMCBI 2008»
13 years 8 months ago
Extraction of semantic biomedical relations from text using conditional random fields
Background: The increasing amount of published literature in biomedicine represents an immense source of knowledge, which can only efficiently be accessed by a new generation of a...
Markus Bundschus, Mathäus Dejori, Martin Stet...
KDD
2009
ACM
379views Data Mining» more  KDD 2009»
14 years 1 months ago
MetaFac: community discovery via relational hypergraph factorization
This paper aims at discovering community structure in rich media social networks, through analysis of time-varying, multi-relational data. Community structure represents the laten...
Yu-Ru Lin, Jimeng Sun, Paul Castro, Ravi B. Konuru...
LCTRTS
2007
Springer
14 years 2 months ago
Scratchpad allocation for data aggregates in superperfect graphs
Existing methods place data or code in scratchpad memory, i.e., SPM by either relying on heuristics or resorting to integer programming or mapping it to a graph coloring problem. ...
Lian Li 0002, Quan Hoang Nguyen, Jingling Xue
ICDM
2006
IEEE
152views Data Mining» more  ICDM 2006»
14 years 2 months ago
Application of Graph-based Data Mining to Metabolic Pathways
We present a method for finding biologically meaningful patterns on metabolic pathways using the SUBDUE graph-based relational learning system. A huge amount of biological data t...
Chang Hun You, Lawrence B. Holder, Diane J. Cook
JSYML
2008
100views more  JSYML 2008»
13 years 8 months ago
Measurable chromatic numbers
We show that if add(null) = c, then the globally Baire and universally measurable chromatic numbers of the graph of any Borel function on a Polish space are equal and at most three...
Benjamin D. Miller