Sciweavers

543 search results - page 70 / 109
» A Multiagent Algorithm for Graph Partitioning
Sort
View
TROB
2008
159views more  TROB 2008»
13 years 7 months ago
Distributed Connectivity Control of Mobile Networks
Control of mobile networks raises fundamental and novel problems in controlling the structure of the resulting dynamic graphs. In particular, in applications involving mobile senso...
Michael M. Zavlanos, George J. Pappas
EVOW
2004
Springer
14 years 1 months ago
A Hierarchical Social Metaheuristic for the Max-Cut Problem
This paper introduces a new social metaheuristic for the Max-Cut problem applied to a weighted undirected graph. This problem consists in finding a partition of the nodes into two ...
Abraham Duarte, Felipe Fernández, Án...
PODC
2010
ACM
13 years 12 months ago
Brief announcement: tree decomposition for faster concurrent data structures
We show how to partition data structures representable by directed acyclic graphs, i.e. rooted trees, to allow for efficient complex operations, which lie beyond inserts, deletes ...
Johannes Schneider, Roger Wattenhofer
CORR
2007
Springer
118views Education» more  CORR 2007»
13 years 7 months ago
Contains and Inside relationships within combinatorial Pyramids
7 Irregular pyramids are made of a stack of successively reduced graphs embedded in the plane. Such pyramids are used within the segmentation framework to encode a hierarchy of pa...
Luc Brun, Walter G. Kropatsch
ICDAR
2011
IEEE
12 years 7 months ago
Graph Clustering-Based Ensemble Method for Handwritten Text Line Segmentation
—Handwritten text line segmentation on real-world data presents significant challenges that cannot be overcome by any single technique. Given the diversity of approaches and the...
Vasant Manohar, Shiv Naga Prasad Vitaladevuni, Hua...