Sciweavers

1538 search results - page 13 / 308
» Spectral Techniques in Graph Algorithms
Sort
View
ICMCS
2005
IEEE
137views Multimedia» more  ICMCS 2005»
14 years 1 months ago
Co-Clustering of Time-Evolving News Story with Transcript and Keyframe
This paper presents techniques in clustering the sametopic news stories according to event themes. We model the relationship of stories with textual and visual concepts under the ...
Xiao Wu, Chong-Wah Ngo, Qing Li
ICASSP
2011
IEEE
12 years 11 months ago
A novel multi-band spectral subtraction method based on phase modification and magnitude compensation
The spectral subtraction method is historically one of the first algorithms proposed for noise reduction. However, most implementations and variations of the basic technique cann...
Chao Li, Wen-Ju Liu
GMP
2006
IEEE
120views Solid Modeling» more  GMP 2006»
14 years 1 months ago
Spectral Sequencing Based on Graph Distance
The construction of linear mesh layouts has found various applications, such as implicit mesh filtering and mesh streaming, where a variety of layout quality criteria, e.g., span ...
Rong Liu, Hao Zhang 0002, Oliver van Kaick
ISAAC
2005
Springer
111views Algorithms» more  ISAAC 2005»
14 years 1 months ago
Boosting Spectral Partitioning by Sampling and Iteration
A partition of a set of n items is a grouping of the items into k disjoint classes of equal size. Any partition can be modeled as a graph: the items become the vertices of the grap...
Joachim Giesen, Dieter Mitsche
PAMI
2010
112views more  PAMI 2010»
13 years 6 months ago
Polynomial Time Algorithms for Ratio Regions and a Variant of Normalized Cut
—In partitioning, clustering, and grouping problems, a typical goal is to group together similar objects, or pixels in the case of image processing. At the same time, another goa...
Dorit S. Hochbaum