Sciweavers

312 search results - page 7 / 63
» Line spectral pairs
Sort
View
NIPS
2004
13 years 11 months ago
Self-Tuning Spectral Clustering
We study a number of open issues in spectral clustering: (i) Selecting the appropriate scale of analysis, (ii) Handling multi-scale data, (iii) Clustering with irregular backgroun...
Lihi Zelnik-Manor, Pietro Perona
JSAC
2006
77views more  JSAC 2006»
13 years 9 months ago
Spectral shaping of UWB signals for time-hopping impulse radio
This paper studies the design of signaling waveforms for time-hopping impulse radio (TH-IR) with limits on the power spectral density. Such restrictions are imposed by the spectra...
Yves-Paul Nakache, Andreas F. Molisch
STOC
1994
ACM
125views Algorithms» more  STOC 1994»
14 years 1 months ago
A spectral technique for coloring random 3-colorable graphs (preliminary version)
Let G(3n, p, 3) be a random 3-colorable graph on a set of 3n vertices generated as follows. First, split the vertices arbitrarily into three equal color classes and then choose ev...
Noga Alon, Nabil Kahale
BIRTHDAY
2010
Springer
14 years 1 months ago
Clustering the Normalized Compression Distance for Influenza Virus Data
The present paper analyzes the usefulness of the normalized compression distance for the problem to cluster the hemagglutinin (HA) sequences of influenza virus data for the HA gene...
Kimihito Ito, Thomas Zeugmann, Yu Zhu
CVPR
2007
IEEE
14 years 11 months ago
Learning and Matching Line Aspects for Articulated Objects
Traditional aspect graphs are topology-based and are impractical for articulated objects. In this work we learn a small number of aspects, or prototypical views, from video data. ...
Xiaofeng Ren