Sciweavers

2487 search results - page 398 / 498
» Partitions of Graphs into Trees
Sort
View
AI
2011
Springer
13 years 3 months ago
Bounded approximate decentralised coordination via the max-sum algorithm
In this paper we propose a novel approach to decentralised coordination, that is able to efficiently compute solutions with a guaranteed approximation ratio. Our approach is base...
Alex Rogers, Alessandro Farinelli, Ruben Stranders...
ICDM
2006
IEEE
176views Data Mining» more  ICDM 2006»
14 years 2 months ago
Razor: mining distance-constrained embedded subtrees
Due to their capability for expressing semantics and relationships among data objects, semi-structured documents have become a common way of representing domain knowledge. Compari...
Henry Tan, Tharam S. Dillon, Fedja Hadzic, Elizabe...
ICALP
2005
Springer
14 years 1 months ago
New Approaches for Virtual Private Network Design
Virtual Private Network Design is the following NP-hard problem. We are given a communication network, represented as a weighted graph with thresholds on the nodes which represent...
Friedrich Eisenbrand, Fabrizio Grandoni, Gianpaolo...
SSS
2005
Springer
14 years 1 months ago
Synchronous vs. Asynchronous Unison
This paper considers the self-stabilizing unison problem. The contribution of this paper is threefold. First, we establish that when any self-stabilizing asynchronous unison protoc...
Christian Boulinier, Franck Petit, Vincent Villain
KCAP
2003
ACM
14 years 1 months ago
Towards topic-based summarization for interactive document viewing
Our research aims at interactive document viewers that can select and highlight relevant text passages on demand. Another related objective is the generation of topic-specific su...
Achim G. Hoffmann, Son Bao Pham