Sciweavers

6365 search results - page 164 / 1273
» Fast Local Computation Algorithms
Sort
View
201
Voted
CVPR
2012
IEEE
13 years 7 months ago
Top-down visual saliency via joint CRF and dictionary learning
Top-down visual saliency facilities object localization by providing a discriminative representation of target objects and a probability map for reducing the search space. In this...
Jimei Yang, Ming-Hsuan Yang
RTCSA
2007
IEEE
15 years 11 months ago
Fast Schedulability Analysis Using Commodity Graphics Hardware
In this paper we explore the possibility of using commodity graphics processing units (GPUs) to speedup standard schedulability analysis algorithms. Our long-term goal is to explo...
Jimin Feng, Samarjit Chakraborty, Bertil Schmidt, ...
BC
2005
127views more  BC 2005»
15 years 4 months ago
Computational modeling and exploration of contour integration for visual saliency
Abstract Weproposeacomputationalmodelofcontourintegration for visual saliency. The model uses biologically plausible devices to simulate how the representations of elements aligned...
T. Nathan Mundhenk, Laurent Itti
SC
2003
ACM
15 years 10 months ago
A New Parallel Kernel-Independent Fast Multipole Method
We present a new adaptive fast multipole algorithm and its parallel implementation. The algorithm is kernel-independent in the sense that the evaluation of pairwise interactions do...
Lexing Ying, George Biros, Denis Zorin, Harper Lan...
138
Voted
IVC
2007
142views more  IVC 2007»
15 years 4 months ago
Fast stochastic optimization for articulated structure tracking
Recently, an optimization approach for fast visual tracking of articulated structures based on Stochastic Meta-Descent (SMD) [7] has been presented. SMD is a gradient descent with...
Matthieu Bray, Esther Koller-Meier, Nicol N. Schra...