2004 search results - page 102 / 401 » Sampling from large graphs |
157
click to vote
IPCO
2008
15 years 4 months ago
2008
Abstract. Semidefinite relaxations are known to deliver good approximations for combinatorial optimization problems like graph bisection. Using the spectral bundle method it is pos...
149
click to vote
NIPS
2001
15 years 4 months ago
2001
Drawing on the correspondence between the graph Laplacian, the Laplace-Beltrami operator on a manifold, and the connections to the heat equation, we propose a geometrically motiva...
134
click to vote
CVPR
2006
IEEE
16 years 5 months ago
2006
IEEE
We investigate the problem of learning the structure of an articulated object, i.e. its kinematic chain, from feature trajectories under affine projections. We demonstrate this po...
151
click to vote
AVI
2006
15 years 4 months ago
2006
Scientific measurements are often depicted as line graphs. Stateof-the-art high throughput systems in life sciences, telemetry and electronics measurement rapidly generate hundred...
133
click to vote
KDD
2007
ACM
16 years 3 months ago
2007
ACM
Metasearch engine, Comparison-shopping and Deep Web crawling applications need to extract search result records enwrapped in result pages returned from search engines in response ...