Sciweavers

1221 search results - page 165 / 245
» Balanced graph partitioning
Sort
View
ISAAC
2009
Springer
109views Algorithms» more  ISAAC 2009»
14 years 4 months ago
A Linear Vertex Kernel for Maximum Internal Spanning Tree
We present an algorithm that for any graph G and integer k ≥ 0 in time polynomial in the size of G either nds a spanning tree with at least k internal vertices, or outputs a ne...
Fedor V. Fomin, Serge Gaspers, Saket Saurabh, St&e...
ICASSP
2007
IEEE
14 years 4 months ago
Sound Source Tracking and Formation using Normalized Cuts
The goal of computational auditory scene analysis (CASA) is to create computer systems that can take as input a mixture of sounds and form packages of acoustic evidence such that ...
Mathieu Lagrange, George Tzanetakis
ICMCS
2007
IEEE
125views Multimedia» more  ICMCS 2007»
14 years 4 months ago
A Framework for Provisioning Overlay Network Based Multimedia Distribution Services
In this paper, we present a graph-theoretic framework for provisioning overlay network based multimedia distribution services to a diverse set of receivers. Considering resource l...
Dewan Tanvir Ahmed, Shervin Shirmohammadi
PKDD
2007
Springer
132views Data Mining» more  PKDD 2007»
14 years 4 months ago
An Algorithm to Find Overlapping Community Structure in Networks
Recent years have seen the development of many graph clustering algorithms, which can identify community structure in networks. The vast majority of these only find disjoint commun...
Steve Gregory
ICMCS
2005
IEEE
137views Multimedia» more  ICMCS 2005»
14 years 3 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