Sciweavers

522 search results - page 22 / 105
» A Graph Theoretical Approach to Network Encoding Complexity
Sort
View
MOBICOM
2012
ACM
13 years 5 months ago
Temporal reachability graphs
While a natural fit for modeling and understanding mobile networks, time-varying graphs remain poorly understood. Indeed, many of the usual concepts of static graphs have no obvi...
John Whitbeck, Marcelo Dias de Amorim, Vania Conan...
BIB
2008
93views more  BIB 2008»
15 years 2 months ago
A structured approach for the engineering of biochemical network models, illustrated for signalling pathways
Quantitative models of biochemical networks (signal transduction cascades, metabolic pathways, gene regulatory circuits) are a central component of modern systems biology. Buildin...
Rainer Breitling, David Gilbert, Monika Heiner, Ri...
SYNASC
2007
IEEE
119views Algorithms» more  SYNASC 2007»
15 years 9 months ago
Graph Rewriting and Strategies for Modeling Biochemical Networks
In this paper, we present a rewriting framework for modeling molecular complexes, biochemical reaction rules, and generation of biochemical networks based on the representation of...
Oana Andrei, Hélène Kirchner
DCC
2006
IEEE
16 years 2 months ago
Joint Source-Channel Decoding of Multiple Description Quantized Markov Sequences
This paper proposes a framework for joint source-channel decoding of Markov sequences that are coded by a fixed-rate multiple description quantizer (MDQ), and transmitted via a lo...
Xiaolin Wu, Xiaohan Wang
PR
2007
189views more  PR 2007»
15 years 2 months ago
Information cut for clustering using a gradient descent approach
We introduce a new graph cut for clustering which we call the Information Cut. It is derived using Parzen windowing to estimate an information theoretic distance measure between p...
Robert Jenssen, Deniz Erdogmus, Kenneth E. Hild II...