Sciweavers

1279 search results - page 49 / 256
» Fast Implementations of Automata Computations
Sort
View
RECOMB
2006
Springer
14 years 8 months ago
Simple and Fast Inverse Alignment
For as long as biologists have been computing alignments of sequences, the question of what values to use for scoring substitutions and gaps has persisted. While some choices for s...
John D. Kececioglu, Eagu Kim
ICPR
2000
IEEE
14 years 8 months ago
Fast and Accurate Motion Estimation Using Orientation Tensors and Parametric Motion Models
Motion estimation in image sequences is an important step in many computer vision and image processing applications. Several methods for solving this problem have been proposed, b...
Gunnar Farnebäck
SMA
2005
ACM
167views Solid Modeling» more  SMA 2005»
14 years 1 months ago
Boolean operations on 3D selective Nef complexes: optimized implementation and experiments
Nef polyhedra in d-dimensional space are the closure of half-spaces under boolean set operation. In consequence, they can represent non-manifold situations, open and closed sets, ...
Peter Hachenberger, Lutz Kettner
EMSOFT
2004
Springer
14 years 1 months ago
A model-based approach to integrating security policies for embedded devices
Embedded devices like smart cards can now run multiple interacting applications. A particular challenge in this domain is to dynamically integrate diverse security policies. In th...
Michael McDougall, Rajeev Alur, Carl A. Gunter
CLUSTER
2011
IEEE
12 years 7 months ago
Incorporating Network RAM and Flash into Fast Backing Store for Clusters
—We present Nswap2L, a fast backing storage system for general purpose clusters. Nswap2L implements a single device interface on top of multiple heterogeneous physical storage de...
Tia Newhall, Douglas Woos