Sciweavers

5889 search results - page 418 / 1178
» Graph Layout Problems
Sort
View
IBPRIA
2007
Springer
16 years 1 months ago
Locating and Segmenting 3D Deformable Objects by Using Clusters of Contour Fragments
Abstract. This paper presents a new approach to the problem of simultaneous location and segmentation of object in images. The main emphasis is done on the information provided by ...
Manuel J. Marín-Jiménez, Nicolas P&e...
IAT
2006
IEEE
16 years 28 days ago
A Multi-agent Mechanism for Topology Balancing in Unstructured P2P Networks
Unstructured P2P networks can grow in an ad-hoc and give rise to scale-free graphs where most of the nodes form clusters or hubs around few resourceful nodes. This leads to conges...
Prithviraj Dasgupta
SOFSEM
2005
Springer
16 years 10 days ago
Discovering Treewidth
Abstract. Treewidth is a graph parameter with several interesting theoretical and practical applications. This survey reviews algorithmic results on determining the treewidth of a ...
Hans L. Bodlaender
ESA
2004
Springer
97views Algorithms» more  ESA 2004»
16 years 8 days ago
Radio Network Clustering from Scratch
Abstract. We propose a novel randomized algorithm for computing a dominating set based clustering in wireless ad-hoc and sensor networks. The algorithm works under a model which ca...
Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer
PPAM
2001
Springer
15 years 11 months ago
Dedicated Scheduling of Biprocessor Tasks to Minimize Mean Flow Time
Abstract. This paper investigates the complexity of scheduling biprocessor tasks on dedicated processors to minimize mean flow time. Since the general problem is strongly NP-hard,...
Krzysztof Giaro, Marek Kubale, Michal Malafiejski,...