Sciweavers

170 search results - page 33 / 34
» On Metro-Line Crossing Minimization
Sort
View
ISAAC
2010
Springer
257views Algorithms» more  ISAAC 2010»
13 years 5 months ago
Approximating Minimum Bending Energy Path in a Simple Corridor
Abstract. In this paper, we consider the problem of computing a minimum bending energy path (or MinBEP) in a simple corridor. Given a simple 2D corridor C bounded by straight line ...
Jinhui Xu, Lei Xu, Yulai Xie
DAC
2007
ACM
14 years 8 months ago
A System For Coarse Grained Memory Protection In Tiny Embedded Processors
Many embedded systems contain resource constrained microcontrollers where applications, operating system components and device drivers reside within a single address space with no...
Ram Kumar, Akhilesh Singhania, Andrew Castner, Edd...
FOCS
2009
IEEE
14 years 2 months ago
Planarity Allowing Few Error Vertices in Linear Time
— We show that for every fixed k, there is a linear time algorithm that decides whether or not a given graph has a vertex set X of order at most k such that G − X is planar (w...
Ken-ichi Kawarabayashi
WABI
2009
Springer
129views Bioinformatics» more  WABI 2009»
14 years 1 months ago
biRNA: Fast RNA-RNA Binding Sites Prediction
We present biRNA, a novel algorithm for prediction of binding sites between two RNAs based on minimization of binding free energy. Similar to RNAup approach [30], we assume the bin...
Hamidreza Chitsaz, Rolf Backofen, Süleyman Ce...
DATE
2007
IEEE
126views Hardware» more  DATE 2007»
14 years 1 months ago
The ARTEMIS cross-domain architecture for embedded systems
platform and a suite of abstract components with which new developments in different application domains can be engineered with minimal effort [1]p.16. Generic platforms, or refere...
Hermann Kopetz