Sciweavers

1484 search results - page 134 / 297
» Ants meeting algorithms
Sort
View
ICPR
2000
IEEE
15 years 11 months ago
Growing Gaussian Mixture Models for Pose Invariant Face Recognition
A major challenge for face recognition algorithms lies in the variance faces undergo while changing pose. This problem is typically addressed by building view dependent models bas...
Ralph Gross, Jie Yang, Alex Waibel
SAC
2009
ACM
15 years 4 months ago
On scheduling soft real-time tasks with lock-free synchronization for embedded devices
In this paper, we consider minimizing the system-level energy consumption through dynamic voltage scaling for embedded devices, while a) allowing concurrent access to shared objec...
Shouwen Lai, Binoy Ravindran, Hyeonjoong Cho
DATE
2009
IEEE
89views Hardware» more  DATE 2009»
15 years 4 months ago
Robust non-preemptive hard real-time scheduling for clustered multicore platforms
—Scheduling task graphs under hard (end-to-end) timing constraints is an extensively studied NP-hard problem of critical importance for predictable software mapping on Multiproce...
Michele Lombardi, Michela Milano, Luca Benini
ISPD
2003
ACM
171views Hardware» more  ISPD 2003»
15 years 3 months ago
Timing driven force directed placement with physical net constraints
This paper presents a new timing driven force directed placement algorithm that meets physical net length constraints as well as constraints on specific pin sets. It is the first ...
Karthik Rajagopal, Tal Shaked, Yegna Parasuram, Tu...
DATE
2004
IEEE
151views Hardware» more  DATE 2004»
15 years 1 months ago
Dynamic Voltage and Cache Reconfiguration for Low Power
Given a set of real-time tasks scheduled using the earliest deadline first (EDF) algorithm, we discuss two techniques for reducing power consumption while meeting all timing requi...
André C. Nácul, Tony Givargis