Sciweavers

6274 search results - page 620 / 1255
» From query complexity to computational complexity
Sort
View
CVPR
2010
IEEE
1790views Computer Vision» more  CVPR 2010»
16 years 3 months ago
Data Driven Mean-Shift Belief Propagation For non-Gaussian MRFs
We introduce a novel data-driven mean-shift belief propagation (DDMSBP) method for non-Gaussian MRFs, which often arise in computer vision applications. With the aid of scale sp...
Minwoo Park, S. Kashyap, R. Collins, and Y. Liu
IPPS
2009
IEEE
16 years 1 months ago
Compiler-enhanced incremental checkpointing for OpenMP applications
As modern supercomputing systems reach the peta-flop performance range, they grow in both size and complexity. This makes them increasingly vulnerable to failures from a variety ...
Greg Bronevetsky, Daniel Marques, Keshav Pingali, ...
ALDT
2009
Springer
181views Algorithms» more  ALDT 2009»
16 years 1 months ago
Optimizing the Hurwicz Criterion in Decision Trees with Imprecise Probabilities
This paper is devoted to sequential decision problems with imprecise probabilities. We study the problem of determining an optimal strategy according to the Hurwicz criterion in de...
Gildas Jeantet, Olivier Spanjaard
ISNN
2009
Springer
16 years 1 months ago
Nonlinear Component Analysis for Large-Scale Data Set Using Fixed-Point Algorithm
Abstract. Nonlinear component analysis is a popular nonlinear feature extraction method. It generally uses eigen-decomposition technique to extract the principal components. But th...
Weiya Shi, Yue-Fei Guo
ISVC
2009
Springer
16 years 1 months ago
Group Action Recognition Using Space-Time Interest Points
Group action recognition is a challenging task in computer vision due to the large complexity induced by multiple motion patterns. This paper aims at analyzing group actions in vid...
Qingdi Wei, Xiaoqin Zhang, Yu Kong, Weiming Hu, Ha...