Sciweavers

56 search results - page 3 / 12
» Structural Similarity: Spectral Methods for Relaxed Blockmod...
Sort
View
NIPS
2008
13 years 8 months ago
Spectral Hashing
Semantic hashing[1] seeks compact binary codes of data-points so that the Hamming distance between codewords correlates with semantic similarity. In this paper, we show that the p...
Yair Weiss, Antonio Torralba, Robert Fergus
ISITA
2010
13 years 5 months ago
Spectral entropy-based bit allocation
In transform-based compression schemes, the task of choosing, quantizing, and coding the coefficients that best represent a signal is of prime importance. As a step in this directi...
Malavika Bhaskaranand, Jerry D. Gibson
SPIESR
2003
136views Database» more  SPIESR 2003»
13 years 8 months ago
Media segmentation using self-similarity decomposition
We present a framework for analyzing the structure of digital media streams. Though our methods work for video, text, and audio, we concentrate on detecting the structure of digit...
Jonathan Foote, Matthew L. Cooper
CVPR
2005
IEEE
14 years 9 months ago
Corrected Laplacians: Closer Cuts and Segmentation with Shape Priors
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...
David Tolliver, Gary L. Miller, Robert T. Collins
KDD
2007
ACM
244views Data Mining» more  KDD 2007»
14 years 7 months ago
A Recommender System Based on Local Random Walks and Spectral Methods
In this paper, we design recommender systems for weblogs based on the link structure among them. We propose algorithms based on refined random walks and spectral methods. First, w...
Zeinab Abbassi, Vahab S. Mirrokni