Sciweavers

485 search results - page 78 / 97
» Unconstraint Assignment Problem: A Molecular Computing Appro...
Sort
View
CVPR
2010
IEEE
14 years 3 months ago
Action Unit Detection with Segment-based SVMs
Automatic facial action unit (AU) detection from video is a long-standing problem in computer vision. Two main approaches have been pursued: (1) static modeling--typically posed a...
Tomas Simon, Nguyen Minh, Fernando De la Torre, Je...
DAC
2008
ACM
13 years 9 months ago
Application mapping for chip multiprocessors
The problem attacked in this paper is one of automatically mapping an application onto a Network-on-Chip (NoC) based chip multiprocessor (CMP) architecture in a locality-aware fas...
Guangyu Chen, Feihui Li, Seung Woo Son, Mahmut T. ...
ICPP
1999
IEEE
13 years 11 months ago
SLC: Symbolic Scheduling for Executing Parameterized Task Graphs on Multiprocessors
Task graph scheduling has been found effective in performance prediction and optimization of parallel applications. A number of static scheduling algorithms have been proposed for...
Michel Cosnard, Emmanuel Jeannot, Tao Yang
3DOR
2009
13 years 8 months ago
Retrieval of 3D Articulated Objects Using a Graph-based Representation
Most of the approaches which address the problem of 3D object retrieval, use global descriptors of the objects which fail to consistently compensate for the intra-class variabilit...
Alexander Agathos, Ioannis Pratikakis, Panagiotis ...
LATIN
2010
Springer
13 years 6 months ago
On Quadratic Threshold CSPs
A predicate P : {−1, 1}k → {0, 1} can be associated with a constraint satisfaction problem Max CSP(P). P is called “approximation resistant” if Max CSP(P) cannot be approxi...
Per Austrin, Siavosh Benabbas, Avner Magen