4009 search results - page 193 / 802 » Clustering on Complex Graphs |
119
Voted
SYNASC
2007
IEEE
15 years 10 months ago
2007
IEEE
In this paper, we present a rewriting framework for modeling molecular complexes, biochemical reaction rules, and generation of biochemical networks based on the representation of...
125
click to vote
AMW
2010
15 years 5 months ago
2010
Based on practical observations on rule-based inference on RDF data, we study the problem of redundancy elimination in RDF in the presence of rules (in the form of Datalog rules) a...
168
Voted
BMCBI
2010
15 years 1 months ago
2010
Background: Physical maps are the substrate of genome sequencing and map-based cloning and their construction relies on the accurate assembly of BAC clones into large contigs that...
169
click to vote
PR
2008
15 years 3 months ago
2008
We describe an annealing procedure that computes the normalized N-cut of a weighted graph G. The first phase transition computes the solution of the approximate normalized 2-cut p...
114
click to vote
ICCAD
2007
IEEE
16 years 1 months ago
2007
IEEE
— We present a new linear time technique to compute criticality information in a timing graph by dividing it into “zones”. Errors in using tightness probabilities for critica...