Sciweavers

2612 search results - page 183 / 523
» Assemblies as Graph Processes
Sort
View
DATE
2010
IEEE
134views Hardware» more  DATE 2010»
15 years 11 months ago
Simultaneous budget and buffer size computation for throughput-constrained task graphs
Abstract—Modern embedded multimedia systems process multiple concurrent streams of data processing jobs. Streams often have throughput requirements. These jobs are implemented on...
Maarten Wiggers, Marco Bekooij, Marc Geilen, Twan ...
ICRA
2000
IEEE
129views Robotics» more  ICRA 2000»
15 years 11 months ago
Data Association for Mobile Robot Navigation: A Graph Theoretic Approach
Data association is the process of relating features observed in the environment to features viewed previously or to features in a map. Correct feature association is essential fo...
Tim Bailey, Eduardo Mario Nebot, Julio Rosenblatt,...
ICIP
2007
IEEE
15 years 10 months ago
Lipreading by Locality Discriminant Graph
The major problem in building a good lipreading system is to extract effective visual features from enormous quantity of video sequences data. For appearance-based feature analysi...
Yun Fu, Xi Zhou, Ming Liu, Mark Hasegawa-Johnson, ...
DAGSTUHL
2003
15 years 7 months ago
Feature tracking with skeleton graphs
One way to visualize large time-dependent data sets, is by visualization of the evolution of features in these data. The process consists of four steps: feature extraction, featur...
Benjamin Vrolijk, Freek Reinders, Frits H. Post
ICASSP
2010
IEEE
15 years 6 months ago
Fast signal analysis and decomposition on graphs using the Sparse Matrix Transform
Recently, the Sparse Matrix Transform (SMT) has been proposed as a tool for estimating the eigen-decomposition of high dimensional data vectors [1]. The SMT approach has two major...
Leonardo R. Bachega, Guangzhi Cao, Charles A. Boum...