Sciweavers

2994 search results - page 362 / 599
» Time sequences
Sort
View
WABI
2001
Springer
138views Bioinformatics» more  WABI 2001»
15 years 8 months ago
Algorithms for Finding Gene Clusters
Abstract. Comparing gene orders in completely sequenced genomes is a standard approach to locate clusters of functionally associated genes. Often, gene orders are modeled as permut...
Steffen Heber, Jens Stoye
152
Voted
ASAP
2000
IEEE
184views Hardware» more  ASAP 2000»
15 years 8 months ago
Tradeoff Analysis and Architecture Design of a Hybrid Hardware/Software Sorter
Sorting long sequences of keys is a problem that occurs in many different applications. For embedded systems, a uniprocessor software solution is often not applicable due to the l...
Marcus Bednara, Oliver Beyer, Jürgen Teich, R...
CVPR
2000
IEEE
15 years 8 months ago
Scene Modeling for Wide Area Surveillance and Image Synthesis
We present a method for modeling a scene that is observed by a moving camera, where only a portion of the scene is visible at any time. This method uses mixture models to represen...
Anurag Mittal, Daniel P. Huttenlocher
ACPC
1999
Springer
15 years 8 months ago
Modeling and Scheduling for MPEG-4 Based Video Encoder Using a Cluster of Workstations
In this paper, we first present an Object Composition Petri Nets (OCPN) based model methodology for describing the dynamic behaviour of the multiple video objects and user interac...
Yong He, Ishfaq Ahmad, Ming L. Liou
IPPS
1998
IEEE
15 years 8 months ago
Processor Lower Bound Formulas for Array Computations and Parametric Diophantine Systems
Using a directed acyclic graph (dag) model of algorithms, we solve a problem related to precedenceconstrained multiprocessor schedules for array computations: Given a sequence of ...
Peter R. Cappello, Ömer Egecioglu