Sciweavers

1221 search results - page 192 / 245
» Balanced graph partitioning
Sort
View
ESA
2007
Springer
105views Algorithms» more  ESA 2007»
14 years 1 months ago
Finding Branch-Decompositions and Rank-Decompositions
Abstract. We present a new algorithm that can output the rankdecomposition of width at most k of a graph if such exists. For that we use an algorithm that, for an input matroid rep...
Petr Hlinený, Sang-il Oum
ICLP
2007
Springer
14 years 1 months ago
Static Region Analysis for Mercury
Abstract. Region-based memory management is a form of compiletime memory management, well-known from the functional programming world. This paper describes a static region analysis...
Quan Phan, Gerda Janssens
ICPR
2006
IEEE
14 years 1 months ago
Audio Segmentation and Speaker Localization in Meeting Videos
Segmenting different individuals in a group meeting and their speech is an important first step for various tasks such as meeting transcription, automatic camera panning, multime...
Himanshu Vajaria, Tanmoy Islam, Sudeep Sarkar, Rav...
ICCSA
2004
Springer
14 years 1 months ago
A Cluster Based Hierarchical Routing Protocol for Mobile Networks
We propose a hierarchical, cluster based semi-distributed routing protocol for a mobile ad hoc network. The network graph is partitioned into clusters using heuristics and the shor...
Kayhan Erciyes, Geoffrey Marshall
DATE
2010
IEEE
110views Hardware» more  DATE 2010»
14 years 24 days ago
Enabling efficient post-silicon debug by clustering of hardware-assertions
—Bug-free first silicon is not guaranteed by the existing pre-silicon verification techniques. To have impeccable products, it is now required to identify any bug as soon as the ...
Mohammad Hossein Neishaburi, Zeljko Zilic