Sciweavers

4302 search results - page 412 / 861
» Index Pairs Algorithms
Sort
View
PRL
2007
146views more  PRL 2007»
15 years 5 months ago
Neighbor number, valley seeking and clustering
This paper proposes a novel nonparametric clustering algorithm capable of identifying shape-free clusters. This algorithm is based on a nonparametric estimation of the normalized ...
Chaolin Zhang, Xuegong Zhang, Michael Q. Zhang, Ya...
WAW
2010
Springer
270views Algorithms» more  WAW 2010»
15 years 4 months ago
Fast Katz and Commuters: Efficient Estimation of Social Relatedness in Large Networks
Abstract. Motivated by social network data mining problems such as link prediction and collaborative filtering, significant research effort has been devoted to computing topologica...
Pooya Esfandiar, Francesco Bonchi, David F. Gleich...
TWC
2010
15 years 28 days ago
Adaptive linearly constrained minimum variance beamforming for multiuser cooperative relaying using the kalman filter
In this paper, we consider a wireless communication scenario with multiple source-destination pairs communicating through several cooperative amplify-and-forward relay terminals. T...
Amr El-Keyi, Benoît Champagne
WADS
1993
Springer
163views Algorithms» more  WADS 1993»
15 years 10 months ago
Minimum Weight Euclidean Matching and Weighted Relative Neighborhood Graphs
The Minimum Weight Euclidean Matching (MWEM) problem is: given 2n point sites in the plane with Euclidean metric for interpoint distances, match the sites into n pairs so that the...
Andy Mirzaian
CVPR
2008
IEEE
16 years 8 months ago
A fast local descriptor for dense matching
We introduce a novel local image descriptor designed for dense wide-baseline matching purposes. We feed our descriptors to a graph-cuts based dense depth map estimation algorithm ...
Engin Tola, Vincent Lepetit, Pascal Fua