2004 search results - page 123 / 401 » Sampling from large graphs |
147
click to vote
IJCAI
2003
15 years 4 months ago
2003
We equate nonlinear dimensionality reduction (NLDR) to graph embedding with side information about the vertices, and derive a solution to either problem in the form of a kernel-ba...
138
click to vote
COMBINATORICS
2000
15 years 2 months ago
2000
In this article, Temperley's bijection between spanning trees of the square grid on the one hand, and perfect matchings (also known as dimer coverings) of the square grid on ...
147
click to vote
SODA
2012
ACM
13 years 5 months ago
2012
ACM
Given a class of graphs F, we say that a graph G is universal for F, or F-universal, if every H ∈ F is contained in G as a subgraph. The construction of sparse universal graphs ...
115
click to vote
CVPR
2007
IEEE
16 years 5 months ago
2007
IEEE
The goal of this paper is to find sparse and representative spatial priors that can be applied to part-based object localization. Assuming a GMRF prior over part configurations, w...
122
click to vote
MA
2010
Springer
15 years 1 months ago
2010
Springer
In this article, for the first time, one develops a nonparametric methodology for an analysis of shapes of configurations of landmarks on real 3D objects from regular camera pho...