Sciweavers

1439 search results - page 46 / 288
» Fast approximation of centrality
Sort
View
CORR
2012
Springer
230views Education» more  CORR 2012»
12 years 6 months ago
Fast Triangle Counting through Wedge Sampling
Graphs and networks are used to model interactions in a variety of contexts, and there is a growing need to be able to quickly assess the qualities of a graph in order to understa...
C. Seshadhri, Ali Pinar, Tamara G. Kolda
ICIP
2003
IEEE
15 years 18 days ago
Fast similarity search on video signatures
Video signatures are compact representations of video sequences designed for efficient similarity measurement. In this paper, we propose a feature extraction technique to support ...
Sen-Ching S. Cheung, Avideh Zakhor
CVPR
2010
IEEE
14 years 7 months ago
Unified Real-Time Tracking and Recognition with Rotation-Invariant Fast Features
We present a method that unifies tracking and video content recognition with applications to Mobile Augmented Reality (MAR). We introduce the Radial Gradient Transform (RGT) and ...
Gabriel Takacs, Vijay Chandrasekhar, Sam Tsai, Dav...
CORR
2008
Springer
86views Education» more  CORR 2008»
13 years 11 months ago
Fast computation of the median by successive binning
In many important problems, one uses the median instead of the mean to estimate a population's center, since the former is more robust. But in general, computing the median i...
Ryan J. Tibshirani
ISBI
2006
IEEE
14 years 11 months ago
A fast and robust ODF estimation algorithm in Q-ball imaging
We propose a simple and straightforward analytic solution for the Q-ball reconstruction of the diffusion orientation distribution function (ODF) of the underlying fiber population...
Maxime Descoteaux, Elaine Angelino, Shaun Fitzgibb...