Sciweavers

6365 search results - page 279 / 1273
» Fast Local Computation Algorithms
Sort
View
KDD
2012
ACM
212views Data Mining» more  KDD 2012»
13 years 9 months ago
Fast bregman divergence NMF using taylor expansion and coordinate descent
Non-negative matrix factorization (NMF) provides a lower rank approximation of a matrix. Due to nonnegativity imposed on the factors, it gives a latent structure that is often mor...
Liangda Li, Guy Lebanon, Haesun Park
CVPR
2007
IEEE
16 years 8 months ago
Beyond Local Appearance: Category Recognition from Pairwise Interactions of Simple Features
We present a discriminative shape-based algorithm for object category localization and recognition. Our method learns object models in a weakly-supervised fashion, without requiri...
Marius Leordeanu, Martial Hebert, Rahul Sukthankar
ICASSP
2010
IEEE
15 years 6 months ago
Gradient descent approach for secure localization in resource constrained wireless sensor networks
Many sensor network related applications require precise knowledge of the location of constituent nodes. In these applications, it is desirable for the wireless nodes to be able t...
Ravi Garg, Avinash L. Varna, Min Wu
WACV
2012
IEEE
14 years 2 months ago
Online discriminative object tracking with local sparse representation
We propose an online algorithm based on local sparse representation for robust object tracking. Local image patches of a target object are represented by their sparse codes with a...
Qing Wang, Feng Chen, Wenli Xu, Ming-Hsuan Yang
ICIP
2009
IEEE
15 years 4 months ago
Fast and efficient fractional pixel motion estimation for H.264/AVC video coding
This paper presents a fast algorithm for H.264 fractional motion estimation (ME). In H.264 ME is the most time consuming component. The ME process consists of two stages: integer ...
Humaira Nisar, Tae-Sun Choi