Sciweavers

489 search results - page 49 / 98
» A Method for Accelerating the HITS Algorithm
Sort
View
TKDE
1998
122views more  TKDE 1998»
13 years 7 months ago
The Design and Implementation of Seeded Trees: An Efficient Method for Spatial Joins
—Existing methods for spatial joins require pre-existing spatial indices or other precomputation, but such approaches are inefficient and limited in generality. Operand data sets...
Ming-Ling Lo, Chinya V. Ravishankar
PAMI
2012
11 years 10 months ago
Face Recognition Using Sparse Approximated Nearest Points between Image Sets
—We propose an efficient and robust solution for image set classification. A joint representation of an image set is proposed which includes the image samples of the set and thei...
Yiqun Hu, Ajmal S. Mian, Robyn A. Owens
PDCN
2004
13 years 9 months ago
Speculative prefetching of optional locks in distributed systems
We present a family of methods for speeding up distributed locks by exploiting the uneven distribution of both temporal and spatial locality of access behaviour of many applicatio...
Thomas Schöbel-Theuer
ICML
2003
IEEE
14 years 8 months ago
Hierarchical Policy Gradient Algorithms
Hierarchical reinforcement learning is a general framework which attempts to accelerate policy learning in large domains. On the other hand, policy gradient reinforcement learning...
Mohammad Ghavamzadeh, Sridhar Mahadevan
PAMI
2007
253views more  PAMI 2007»
13 years 7 months ago
Gaussian Mean-Shift Is an EM Algorithm
The mean-shift algorithm, based on ideas proposed by Fukunaga and Hostetler (1975), is a hill-climbing algorithm on the density defined by a finite mixture or a kernel density e...
Miguel Á. Carreira-Perpiñán