Sciweavers

13603 search results - page 394 / 2721
» On the Complexity of Computing Treelength
Sort
View
ISCAS
1999
IEEE
61views Hardware» more  ISCAS 1999»
15 years 12 months ago
A transformation for computational latency reduction in turbo-MAP decoding
The SOVA and the log-MAP are commonly used in turbo decoding. In this paper, we propose to modify the sliding window MAP-algorithm in [5]to reduce the computational delay even fur...
Arun Raghupathy, K. J. Ray Liu
CCCG
2010
15 years 9 months ago
Computing straight skeletons of planar straight-line graphs based on motorcycle graphs
We present a simple algorithm for computing straight skeletons of planar straight-line graphs. We exploit the relation between motorcycle graphs and straight skeletons, and introd...
Stefan Huber, Martin Held
BIB
2007
108views more  BIB 2007»
15 years 7 months ago
Bayesian methods in bioinformatics and computational systems biology
Bayesian methods are valuable, inter alia, whenever there is a need to extract information from data that is uncertain or subject to any kind of error or noise (including measurem...
Darren J. Wilkinson
NAR
2006
98views more  NAR 2006»
15 years 7 months ago
oGNM: online computation of structural dynamics using the Gaussian Network Model
An assessment of the equilibrium dynamics of biomolecular systems, and in particular their most cooperativefluctuationsaccessibleundernativestate conditions, is a first step towar...
Lee-Wei Yang, A. J. Rader, Xiong Liu, Christopher ...
TSMC
2008
113views more  TSMC 2008»
15 years 7 months ago
Computational Methods for Verification of Stochastic Hybrid Systems
Stochastic hybrid system (SHS) models can be used to analyze and design complex embedded systems that operate in the presence of uncertainty and variability. Verification of reacha...
Xenofon D. Koutsoukos, Derek Riley