Sciweavers

188 search results - page 11 / 38
» A new meta-method for graph partitioning
Sort
View
ICTAI
2006
IEEE
14 years 1 months ago
Preserving Patterns in Bipartite Graph Partitioning
This paper describes a new bipartite formulation for word-document co-clustering such that hyperclique patterns, strongly affiliated documents in this case, are guaranteed not to ...
Tianming Hu, Chao Qu, Chew Lim Tan, Sam Yuan Sung,...
CORR
2010
Springer
109views Education» more  CORR 2010»
13 years 8 months ago
Pairwise Optimal Discrete Coverage Control for Gossiping Robots
Abstract-- We propose distributed algorithms to automatically deploy a group of robotic agents and provide coverage of a discretized environment represented by a graph. The classic...
Joseph W. Durham, Ruggero Carli, Francesco Bullo
CSL
2011
Springer
13 years 2 months ago
Applications of graph theory to an English rhyming corpus
How much can we infer about the pronunciation of a language – past or present – by observing which words its speakers rhyme? This paper explores the connection between pronunc...
Morgan Sonderegger
IPPS
2002
IEEE
14 years 25 days ago
Variable Partitioning and Scheduling of Multiple Memory Architectures for DSP
Multiple memory module architecture enjoys higher memory access bandwidth and thus higher performance. Two key problems in gaining high performance in this kind of architecture ar...
Qingfeng Zhuge, Bin Xiao, Edwin Hsing-Mean Sha
IEEECIT
2009
IEEE
14 years 2 months ago
Clustering of Software Systems Using New Hybrid Algorithms
—Software clustering is a method for increasing software system understanding and maintenance. Software designers, first use MDG graph to model the structure of software system. ...
Ali Safari Mamaghani, Mohammad Reza Meybodi