Sciweavers

1149 search results - page 32 / 230
» Minimally non-Pfaffian graphs
Sort
View
ICML
2009
IEEE
14 years 10 months ago
Graph construction and b-matching for semi-supervised learning
Graph based semi-supervised learning (SSL) methods play an increasingly important role in practical machine learning systems. A crucial step in graph based SSL methods is the conv...
Tony Jebara, Jun Wang, Shih-Fu Chang
EDBT
2011
ACM
197views Database» more  EDBT 2011»
13 years 1 months ago
Symmetrizations for clustering directed graphs
Graph clustering has generally concerned itself with clustering undirected graphs; however the graphs from a number of important domains are essentially directed, e.g. networks of...
Venu Satuluri, Srinivasan Parthasarathy
FOCS
2003
IEEE
14 years 3 months ago
Clustering with Qualitative Information
We consider the problem of clustering a collection of elements based on pairwise judgments of similarity and dissimilarity. Bansal, Blum and Chawla (in: Proceedings of 43rd FOCS, ...
Moses Charikar, Venkatesan Guruswami, Anthony Wirt...
ICML
2007
IEEE
14 years 10 months ago
Entire regularization paths for graph data
Graph data such as chemical compounds and XML documents are getting more common in many application domains. A main difficulty of graph data processing lies in the intrinsic high ...
Koji Tsuda
ICCV
2007
IEEE
14 years 4 months ago
Monocular SLAM as a Graph of Coalesced Observations
We present a monocular SLAM system that avoids inconsistency by coalescing observations into independent local coordinate frames, building a graph of the local frames, and optimiz...
Ethan Eade, Tom Drummond