Sciweavers

152 search results - page 17 / 31
» Similarity Matrices for Pairs of Graphs
Sort
View
CVPR
2012
IEEE
11 years 10 months ago
Random walks based multi-image segmentation: Quasiconvexity results and GPU-based solutions
We recast the Cosegmentation problem using Random Walker (RW) segmentation as the core segmentation algorithm, rather than the traditional MRF approach adopted in the literature s...
Maxwell D. Collins, Jia Xu, Leo Grady, Vikas Singh
BIOCOMP
2008
13 years 9 months ago
GIPSCo: A Method for Comparison of Protein Structures Based on Geometric Invariants
Protein structure comparison is important for elucidation of evolutionary relationships, function and functionally important amino acid residues. We propose Geometric Invariant bas...
Sandeep Deshmukh, Aniket Dalal, Pramod Wangikar
STOC
2010
ACM
269views Algorithms» more  STOC 2010»
13 years 11 months ago
Approximations for the Isoperimetric and Spectral Profile of Graphs and Related Parameters
The spectral profile of a graph is a natural generalization of the classical notion of its Rayleigh quotient. Roughly speaking, given a graph G, for each 0 < < 1, the spect...
Prasad Raghavendra, David Steurer and Prasad Tetal...
FOCS
2003
IEEE
14 years 28 days 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...
SODA
2010
ACM
189views Algorithms» more  SODA 2010»
14 years 5 months ago
Correlation Clustering with Noisy Input
Correlation clustering is a type of clustering that uses a basic form of input data: For every pair of data items, the input specifies whether they are similar (belonging to the s...
Claire Mathieu, Warren Schudy