Sciweavers

127 search results - page 16 / 26
» Mode Directed Path Finding
Sort
View
JEA
2010
94views more  JEA 2010»
13 years 3 months ago
Layer-free upward crossing minimization
An upward drawing of a DAG G is a drawing of G in which all edges are drawn as curves increasing monotonically in the vertical direction. In this paper, we present a new approach f...
Markus Chimani, Carsten Gutwenger, Petra Mutzel, H...
CORR
2006
Springer
119views Education» more  CORR 2006»
13 years 9 months ago
Network Inference from Co-Occurrences
The study of networked systems is an emerging field, impacting almost every area of engineering and science, including the important domains of communication systems, biology, soc...
Michael Rabbat, Mário A. T. Figueiredo, Rob...
KDD
2007
ACM
227views Data Mining» more  KDD 2007»
14 years 9 months ago
Fast best-effort pattern matching in large attributed graphs
We focus on large graphs where nodes have attributes, such as a social network where the nodes are labelled with each person's job title. In such a setting, we want to find s...
Hanghang Tong, Christos Faloutsos, Brian Gallagher...
CSB
2003
IEEE
108views Bioinformatics» more  CSB 2003»
14 years 2 months ago
A Pattern Matching Algorithm for Codon Optimization and CpG Motif-Engineering in DNA Expression Vectors
Codon optimization enhances the efficiency of DNA expression vectors used in DNA vaccination and gene therapy by increasing protein expression. Additionally, certain nucleotide mo...
Ravi Vijaya Satya, Amar Mukherjee, Udaykumar Ranga
NETWORKS
2006
13 years 9 months ago
Extreme point characterizations for infinite network flow problems
We study capacitated network flow problems with supplies and demands defined on a countably infinite collection of nodes having finite degree. This class of network flow models in...
H. Edwin Romeijn, Dushyant Sharma, Robert L. Smith