Sciweavers

344 search results - page 31 / 69
» Multilevel Approaches applied to the Capacitated Clustering ...
Sort
View
ICDCSW
2005
IEEE
15 years 5 months ago
Bandwidth Clustering for Reliable and Prioritized Network Routing Using Split Agent-Based Method
Recent researches have highlighted the importance of developing a network with distributed problem solving abilities thus enhancing reliability with equal share of network resourc...
Constandinos X. Mavromoustakis, Helen D. Karatza
PR
2008
170views more  PR 2008»
14 years 11 months ago
Annealing and the normalized N-cut
We describe an annealing procedure that computes the normalized N-cut of a weighted graph G. The first phase transition computes the solution of the approximate normalized 2-cut p...
Tomás Gedeon, Albert E. Parker, Collette Ca...
ICASSP
2010
IEEE
15 years 14 hour ago
Song-level multi-pitch tracking by heavily constrained clustering
Given a set of monophonic, harmonic sound sources (e.g. human voices or wind instruments), multi-pitch estimation (MPE) is the task of determining the instantaneous pitches of eac...
Zhiyao Duan, Jinyu Han, Bryan Pardo
KIVS
2011
Springer
14 years 2 months ago
A Feasibility Check for Geographical Cluster Based Routing under Inaccurate Node Localization in Wireless Sensor Networks
Localized geographic single path routing along a wireless network graph requires exact location information about the network nodes to assure message delivery guarantees. Node loc...
Hannes Frey, Ranjith Pillay
WG
2007
Springer
15 years 6 months ago
On Finding Graph Clusterings with Maximum Modularity
Modularity is a recently introduced quality measure for graph clusterings. It has immediately received considerable attention in several disciplines, and in particular in the compl...
Ulrik Brandes, Daniel Delling, Marco Gaertler, Rob...