Sciweavers

2219 search results - page 117 / 444
» Dynamic Programming and Graph Algorithms in Computer Vision
Sort
View
119
Voted
CVPR
2008
IEEE
16 years 4 months ago
Non-negative graph embedding
We introduce a general formulation, called non-negative graph embedding, for non-negative data decomposition by integrating the characteristics of both intrinsic and penalty graph...
Jianchao Yang, Shuicheng Yan, Yun Fu, Xuelong Li, ...
CVPR
2005
IEEE
16 years 4 months ago
Beyond Pairwise Clustering
We consider the problem of clustering in domains where the affinity relations are not dyadic (pairwise), but rather triadic, tetradic or higher. The problem is an instance of the ...
Sameer Agarwal, Jongwoo Lim, Lihi Zelnik-Manor, Pi...
138
Voted
PPOPP
2006
ACM
15 years 8 months ago
On-line automated performance diagnosis on thousands of processes
Performance analysis tools are critical for the effective use of large parallel computing resources, but existing tools have failed to address three problems that limit their scal...
Philip C. Roth, Barton P. Miller
148
Voted
CORR
2008
Springer
118views Education» more  CORR 2008»
15 years 1 months ago
Decentralized Search with Random Costs
A decentralized search algorithm is a method of routing on a random graph that uses only limited, local, information about the realization of the graph. In some random graph model...
Oskar Sandberg
CVPR
2007
IEEE
16 years 4 months ago
Using Stereo Matching for 2-D Face Recognition Across Pose
We propose using stereo matching for 2-D face recognition across pose. We match one 2-D query image to one 2-D gallery image without performing 3-D reconstruction. Then the cost o...
Carlos D. Castillo, David W. Jacobs