Sciweavers

2531 search results - page 171 / 507
» Group testing in graphs
Sort
View
JPDC
2008
129views more  JPDC 2008»
15 years 6 months ago
A framework for scalable greedy coloring on distributed-memory parallel computers
We present a scalable framework for parallelizing greedy graph coloring algorithms on distributed-memory computers. The framework unifies several existing algorithms and blends a ...
Doruk Bozdag, Assefaw Hadish Gebremedhin, Fredrik ...
ISAAC
2004
Springer
112views Algorithms» more  ISAAC 2004»
15 years 11 months ago
Dynamic Tree Cross Products
Abstract. Range searching over tree cross products – a variant of classic range searching – recently has been introduced by Buchsbaum et al. (Proc. 8th ESA, vol. 1879 of LNCS, ...
Marcus Raitner
GLVLSI
2002
IEEE
160views VLSI» more  GLVLSI 2002»
15 years 11 months ago
Computing walsh, arithmetic, and reed-muller spectral decision diagrams using graph transformations
Spectral techniques have found many applications in computeraided design, including synthesis, verification, and testing. Decision diagram representations permit spectral coeffici...
Whitney J. Townsend, Mitchell A. Thornton, Rolf Dr...
SIGIR
2002
ACM
15 years 6 months ago
Generic summarization and keyphrase extraction using mutual reinforcement principle and sentence clustering
A novel method for simultaneous keyphrase extraction and generic text summarization is proposed by modeling text documents as weighted undirected and weighted bipartite graphs. Sp...
Hongyuan Zha
ASUNAM
2009
IEEE
15 years 11 months ago
Mining the Dynamics of Music Preferences from a Social Networking Site
In this paper we present an application of our incremental graph clustering algorithm (DENGRAPH) on a data set obtained from the music community site Last.fm. The aim of our study...
Nico Schlitter, Tanja Falkowski