Sciweavers

3360 search results - page 421 / 672
» Opportunistic Data Structures with Applications
Sort
View
CVPR
2011
IEEE
15 years 1 months ago
Graph Embedding Discriminant Analysis on Grassmannian Manifolds for Improved Image Set Matching
A convenient way of dealing with image sets is to represent them as points on Grassmannian manifolds. While several recent studies explored the applicability of discriminant analy...
Mehrtash Harandi, Sareh, Shirazi (National ICT Aus...
ICASSP
2011
IEEE
14 years 8 months ago
Using residual vector quantization for image content classification
Multistage residual vector quantizers (RVQ) with optimal direct sum decoder codebooks have been successfully designed and implemented for data compression. Due to its multistage s...
Syed Irteza Ali Khan, Christopher F. Barnes
ICCV
2011
IEEE
14 years 5 months ago
Decision Tree Fields
This paper introduces a new formulation for discrete image labeling tasks, the Decision Tree Field (DTF), that combines and generalizes random forests and conditional random fiel...
Sebastian Nowozin, Carsten Rother, Shai Bagon, Ban...
CORR
2012
Springer
272views Education» more  CORR 2012»
14 years 25 days ago
Fast and Exact Top-k Search for Random Walk with Restart
Graphs are fundamental data structures and have been employed for centuries to model real-world systems and phenomena. Random walk with restart (RWR) provides a good proximity sco...
Yasuhiro Fujiwara, Makoto Nakatsuji, Makoto Onizuk...
CORR
2012
Springer
281views Education» more  CORR 2012»
14 years 25 days ago
Belief Propagation by Message Passing in Junction Trees: Computing Each Message Faster Using GPU Parallelization
Compiling Bayesian networks (BNs) to junction trees and performing belief propagation over them is among the most prominent approaches to computing posteriors in BNs. However, bel...
Lu Zheng, Ole J. Mengshoel, Jike Chong