Sciweavers

813 search results - page 49 / 163
» On the Boolean-Width of a Graph: Structure and Applications
Sort
View
BMCBI
2005
84views more  BMCBI 2005»
13 years 9 months ago
A method of precise mRNA/DNA homology-based gene structure prediction
Background: Accurate and automatic gene finding and structural prediction is a common problem in bioinformatics, and applications need to be capable of handling non-canonical spli...
Alexander G. Churbanov, Mark Pauley, Daniel Quest,...
KDD
2009
ACM
172views Data Mining» more  KDD 2009»
14 years 1 months ago
Learning dynamic temporal graphs for oil-production equipment monitoring system
Learning temporal graph structures from time series data reveals important dependency relationships between current observations and histories. Most previous work focuses on learn...
Yan Liu, Jayant R. Kalagnanam, Oivind Johnsen
LREC
2008
142views Education» more  LREC 2008»
13 years 10 months ago
Enriching Frame Semantic Resources with Dependency Graphs
We propose two general and robust methods for enriching resources annotated in the Frame Semantic paradigm with syntactic dependency graphs, which can provide useful additional in...
Hagen Fürstenau
COMAD
2009
13 years 10 months ago
Modeling Relational Data as Graphs for Mining
The focus of this paper is to develop algorithms and a framework for modeling transactional data stored in relational database into graphs for mining. Most of the real-world trans...
Subhesh Pradhan, Sharma Chakravarthy, Aditya Telan...
EDBT
2012
ACM
228views Database» more  EDBT 2012»
11 years 11 months ago
Finding maximal k-edge-connected subgraphs from a large graph
In this paper, we study how to find maximal k-edge-connected subgraphs from a large graph. k-edge-connected subgraphs can be used to capture closely related vertices, and findin...
Rui Zhou, Chengfei Liu, Jeffrey Xu Yu, Weifa Liang...