Sciweavers

1420 search results - page 109 / 284
» Representation of Graphs by OBDDs
Sort
View
CSL
2008
Springer
15 years 8 months ago
Pure Pointer Programs with Iteration
not use pointer arithmetic. Such "pure pointer algorithms" thus are a useful abstraction for studying the nature of logspace-computation. In this paper we introduce a for...
Martin Hofmann, Ulrich Schöpp
DAM
2007
78views more  DAM 2007»
15 years 6 months ago
Flow trees for vertex-capacitated networks
Given a graph G = (V, E) with a cost function c(S) ≥ 0 ∀S ⊆ V , we want to represent all possible min-cut values between pairs of vertices i and j. We consider also the spec...
Refael Hassin, Asaf Levin
NAR
2008
101views more  NAR 2008»
15 years 4 months ago
RNALogo: a new approach to display structural RNA alignment
Regulatory RNAs play essential roles in many essential biological processes, ranging from gene regulation to protein synthesis. This work presents a web-based tool, RNALogo, to cr...
Tzu-Hao Chang, Jorng-Tzong Horng, Hsien-Da Huang
DCG
2011
14 years 10 months ago
A Celtic Framework for Knots and Links
We describe a variant of a method used by modern graphic artists to design what are traditionally called Celtic knots, which are part of a larger family of designs called “mirro...
Jonathan L. Gross, Thomas W. Tucker
ESORICS
2011
Springer
14 years 6 months ago
Automated Information Flow Analysis of Virtualized Infrastructures
The use of server virtualization has been growing steadily, but many enterprises still are reluctant to migrate critical workloads to such infrastructures. One key inhibitor is the...
Sören Bleikertz, Thomas Groß, Matthias ...