Sciweavers

98 search results - page 12 / 20
» A graph spectral approach to shape-from-shading
Sort
View
118
Voted
WICON
2008
15 years 2 months ago
A graph based routing algorithm for multi-hop cognitive radio networks
Cognitive radio networks that allow dynamic spectrum access are considered spectrally more efficient than networks using fixed spectral allocation. These networks are characterize...
Yogesh Reddy Kondareddy, Prathima Agrawal
IPCO
2008
221views Optimization» more  IPCO 2008»
15 years 2 months ago
A Comparative Study of Linear and Semidefinite Branch-and-Cut Methods for Solving the Minimum Graph Bisection Problem
Abstract. Semidefinite relaxations are known to deliver good approximations for combinatorial optimization problems like graph bisection. Using the spectral bundle method it is pos...
Michael Armbruster, Marzena Fügenschuh, Chris...
123
Voted
NIPS
2004
15 years 2 months ago
Nonparametric Transforms of Graph Kernels for Semi-Supervised Learning
We present an algorithm based on convex optimization for constructing kernels for semi-supervised learning. The kernel matrices are derived from the spectral decomposition of grap...
Xiaojin Zhu, Jaz S. Kandola, Zoubin Ghahramani, Jo...
99
Voted
TMI
2008
144views more  TMI 2008»
15 years 15 days ago
Automatic Detection of Regional Heart Rejection in USPIO-Enhanced MRI
Contrast-enhanced magnetic resonance imaging (MRI) is useful to study the infiltration of cells in vivo. This research adopts ultrasmall superparamagnetic iron oxide (USPIO) parti...
Hsun-Hsien Chang, José M. F. Moura, Yijen L...
102
Voted
ICML
2006
IEEE
16 years 1 months ago
A new approach to data driven clustering
We consider the problem of clustering in its most basic form where only a local metric on the data space is given. No parametric statistical model is assumed, and the number of cl...
Arik Azran, Zoubin Ghahramani