Sciweavers

4201 search results - page 286 / 841
» Interaction graphs: Additives
Sort
View
CORR
2008
Springer
138views Education» more  CORR 2008»
15 years 6 months ago
Order-Optimal Consensus through Randomized Path Averaging
Gossip algorithms have recently received significant attention, mainly because they constitute simple and robust message-passing schemes for distributed information processing over...
Florence Bénézit, Alexandros G. Dima...
CORR
2010
Springer
112views Education» more  CORR 2010»
15 years 6 months ago
On Finding Frequent Patterns in Event Sequences
Given a directed acyclic graph with labeled vertices, we consider the problem of finding the most common label sequences ("traces") among all paths in the graph (of some...
Andrea Campagna, Rasmus Pagh
171
Voted
IPL
2006
115views more  IPL 2006»
15 years 6 months ago
Approximate maximum weight branchings
We consider a special subgraph of a weighted directed graph: one comprising only the k heaviest edges incoming to each vertex. We show that the maximum weight branching in this su...
Amitabha Bagchi, Ankur Bhargava, Torsten Suel
TROB
2008
128views more  TROB 2008»
15 years 6 months ago
Convergence-Preserving Switching for Topology-Dependent Decentralized Systems
Abstract-- Stability analysis of decentralized control mechanisms for networked, coordinating systems has generally focused on specific controller implementations, such as nearest ...
Brian Shucker, Todd D. Murphey, John K. Bennett
CSL
2004
Springer
15 years 6 months ago
HyperLex: lexical cartography for information retrieval
This article describes an algorithm called HyperLex that is capable of automatically determining word uses in a textbase without recourse to a dictionary. The algorithm makes use ...
Jean Véronis