Sciweavers

1450 search results - page 135 / 290
» On the Complexity of Hardness Amplification
Sort
View
IBPRIA
2011
Springer
13 years 20 days ago
The Fast and the Flexible: Extended Pseudo Two-Dimensional Warping for Face Recognition
Abstract. In this work, we propose a novel extension of pseudo 2D image warping (P2DW) which allows for joint alignment and recognition of non-rectified face images. P2DW allows f...
Leonid Pishchulin, Tobias Gass, Philippe Dreuw, He...
CVPR
2008
IEEE
14 years 11 months ago
Probabilistic graph and hypergraph matching
We consider the problem of finding a matching between two sets of features, given complex relations among them, going beyond pairwise. Each feature set is modeled by a hypergraph ...
Ron Zass, Amnon Shashua
EMSOFT
2009
Springer
14 years 3 months ago
Cache-aware scheduling and analysis for multicores
The major obstacle to use multicores for real-time applications is that we may not predict and provide any guarantee on real-time properties of embedded software on such platforms...
Nan Guan, Martin Stigge, Wang Yi, Ge Yu
IWPEC
2009
Springer
14 years 3 months ago
What Makes Equitable Connected Partition Easy
We study the Equitable Connected Partition problem, which is the problem of partitioning a graph into a given number of partitions, such that each partition induces a connected sub...
Rosa Enciso, Michael R. Fellows, Jiong Guo, Iyad A...
ATAL
2003
Springer
14 years 2 months ago
Optimizing information exchange in cooperative multi-agent systems
Decentralized control of a cooperative multi-agent system is the problem faced by multiple decision-makers that share a common set of objectives. The decision-makers may be robots...
Claudia V. Goldman, Shlomo Zilberstein