5606 search results - page 631 / 1122 » Randomization Techniques for Graphs. |
200
click to vote
CVPR
2005
IEEE
16 years 9 months ago
2005
IEEE
We optimize over the set of corrected laplacians (CL) associated with a weighted graph to improve the average case normalized cut (NCut) of a graph. Unlike edge-relaxation SDPs, o...
195
click to vote
ICCV
2003
IEEE
16 years 9 months ago
2003
IEEE
We address visual correspondence problems without assuming that scene points have similar intensities in different views.This situation is common, usually due to non-lambertian sc...
199
click to vote
ICML
2007
IEEE
16 years 7 months ago
2007
IEEE
This paper introduces a new approach to actionvalue function approximation by learning basis functions from a spectral decomposition of the state-action manifold. This paper exten...
177
click to vote
ICML
2007
IEEE
16 years 7 months ago
2007
IEEE
We consider spectral clustering and transductive inference for data with multiple views. A typical example is the web, which can be described by either the hyperlinks between web ...
168
click to vote
STOC
2005
ACM
16 years 7 months ago
2005
ACM
We show that every weighted connected graph G contains as a subgraph a spanning tree into which the edges of G can be embedded with average stretch O log2 n log log n . Moreover, w...