1866 search results - page 44 / 374 » Robust Algorithms and Price of Robustness in Shunting Proble... |
161
click to vote
DATE
2009
IEEE
16 years 14 days ago
2009
IEEE
—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...
157
Voted
ICASSP
2009
IEEE
16 years 14 days ago
2009
IEEE
In the last few years, we have witnessed an explosion in applications of sparse representation, the majority of which share the need for finding sparse solutions of underdetermine...
171
click to vote
ICPR
2008
IEEE
16 years 7 months ago
2008
IEEE
Object tracking is one of the most important tasks in computer vision. The unscented particle filter algorithm has been extensively used to tackle this problem and achieved a grea...
192
Voted
CVPR
2009
IEEE
17 years 29 days ago
2009
IEEE
Graph-based methods form a main category of semisupervised
learning, offering flexibility and easy implementation
in many applications. However, the performance of
these methods...
158
click to vote
IPMI
2007
Springer
16 years 6 months ago
2007
Springer
This study evaluates a robust parametric modeling approach for computer-aided detection (CAD) of vertebrae column metastases in whole-body MRI. Our method involves constructing a m...