5100 search results - page 742 / 1020 » The Linear Complexity of a Graph |
189
click to vote
SODA
2003
ACM
15 years 8 months ago
2003
ACM
The natural relaxation for the Group Steiner Tree problem, as well as for its generalization, the Directed Steiner Tree problem, is a flow-based linear programming relaxation. We...
224
click to vote
TSP
2010
15 years 1 months ago
2010
Distributed averaging describes a class of network algorithms for the decentralized computation of aggregate statistics. Initially, each node has a scalar data value, and the goal...
160
click to vote
CVPR
2006
IEEE
16 years 8 months ago
2006
IEEE
In this paper we propose diffusion distance, a new dissimilarity measure between histogram-based descriptors. We define the difference between two histograms to be a temperature f...
172
click to vote
ICCV
2007
IEEE
16 years 8 months ago
2007
IEEE
We propose a non-iterative solution to the PnP problem--the estimation of the pose of a calibrated camera from n 3D-to-2D point correspondences--whose computational complexity gro...
185
click to vote
ICCV
2007
IEEE
16 years 8 months ago
2007
IEEE
Subspace learning based face recognition methods have attracted considerable interests in recent years, including Principal Component Analysis (PCA), Linear Discriminant Analysis ...