Sciweavers

848 search results - page 59 / 170
» Randomness and the linear degrees of computability
Sort
View
AUTOMATICA
2002
263views more  AUTOMATICA 2002»
14 years 11 months ago
Analysis of discrete-time piecewise affine and hybrid systems
In this paper we present various algorithms both for stability and performance analysis of discrete-time Piece-Wise Affine (PWA) systems. For stability, different classes of Lyapu...
Giancarlo Ferrari-Trecate, Francesco Alessandro Cu...
GD
2004
Springer
15 years 5 months ago
Drawing Power Law Graphs
It has been noted that many realistic graphs have a power law degree distribution and exhibit the small world phenomenon. We present drawing methods influenced by recent developm...
Reid Andersen, Fan R. K. Chung, Lincoln Lu
PODC
2006
ACM
15 years 5 months ago
Computing separable functions via gossip
Motivated by applications to sensor, peer-to-peer, and adhoc networks, we study the problem of computing functions of values at the nodes in a network in a totally distributed man...
Damon Mosk-Aoyama, Devavrat Shah
SIAMIS
2010
378views more  SIAMIS 2010»
14 years 6 months ago
Global Interactions in Random Field Models: A Potential Function Ensuring Connectedness
Markov random field (MRF) models, including conditional random field models, are popular in computer vision. However, in order to be computationally tractable, they are limited to ...
Sebastian Nowozin, Christoph H. Lampert
RECOMB
2005
Springer
16 years 4 days ago
Improved Duplication Models for Proteome Network Evolution
Protein-protein interaction networks, particularly that of the yeast S. Cerevisiae, have recently been studied extensively. These networks seem to satisfy the small world property ...
Gürkan Bebek, Petra Berenbrink, Colin Cooper,...