Sciweavers

184 search results - page 3 / 37
» Lipreading: A Graph Embedding Approach
Sort
View
EMSOFT
2011
Springer
12 years 5 months ago
Hard-real-time scheduling of data-dependent tasks in embedded streaming applications
Most of the hard-real-time scheduling theory for multiprocessor systems assumes independent periodic or sporadic tasks. Such a simple task model is not directly applicable to mode...
Mohamed Bamakhrama, Todor Stefanov
ECCV
2004
Springer
14 years 7 months ago
Many-to-Many Feature Matching Using Spherical Coding of Directed Graphs
In recent work, we presented a framework for many-to-many matching of multi-scale feature hierarchies, in which features and their relations were captured in a vertex-labeled, edge...
M. Fatih Demirci, Ali Shokoufandeh, Sven J. Dickin...
RTCSA
2005
IEEE
13 years 11 months ago
Deadline Spanning: A Graph Based Approach
Microkernel based systems tend to depend heavily on IPC. This paper adresses the problem of a system response spanning more than one task in an embedded real-time system. The appr...
Stefan M. Petters
CORR
2007
Springer
111views Education» more  CORR 2007»
13 years 5 months ago
Link Scheduling in STDMA Wireless Networks: A Line Graph Approach
—We consider point to point link scheduling in Spatial Time Division Multiple Access (STDMA) wireless networks under the physical interference model. We propose a novel link sche...
N. Praneeth Kumar, Ashutosh Deepak Gore, Abhay Kar...
ICC
2007
IEEE
13 years 11 months ago
Determination of Optimal Distortion-Based Protection in Progressive Image Transmission: a Heuristic Approach
— In this paper a method for the fast determination of distortion-based optimal unequal error protection (UEP) of bitstreams generated by embedded image coders is described. The ...
Alessio Torquati, Maria Fresia, Fabio Lavagetto