Sciweavers

3265 search results - page 272 / 653
» Representing Groups on Graphs
Sort
View
AUTOMATICA
2010
130views more  AUTOMATICA 2010»
15 years 6 months ago
Discrete-time dynamic average consensus
We propose a class of discrete-time dynamic average consensus algorithms that allow a group of agents to track the average of their reference inputs. The convergence results rely ...
Minghui Zhu, Sonia Martínez
CANDC
2006
ACM
15 years 6 months ago
Identification of functional modules in a PPI network by clique percolation clustering
Large-scale experiments and data integration have provided the opportunity to systematically analyze and comprehensively understand the topology of biological networks and biochem...
Shi-Hua Zhang, Xue-Mei Ning, Xiang-Sun Zhang
COMBINATORICS
2006
132views more  COMBINATORICS 2006»
15 years 6 months ago
On Computing the Distinguishing Numbers of Trees and Forests
Let G be a graph. A vertex labeling of G is distinguishing if the only label-preserving automorphism of G is the identity map. The distinguishing number of G, D(G), is the minimum...
Christine T. Cheng
ENTCS
2006
109views more  ENTCS 2006»
15 years 6 months ago
Specifications via Realizability
We present a system, called RZ, for automatic generation of program specifications from mathematical theories. We translate mathematical theories to specifications by computing th...
Andrej Bauer, Christopher A. Stone
ICDE
2005
IEEE
164views Database» more  ICDE 2005»
16 years 8 months ago
Knowledge Discovery from Transportation Network Data
Transportation and Logistics are a major sector of the economy, however data analysis in this domain has remained largely in the province of optimization. The potential of data mi...
Wei Jiang, Jaideep Vaidya, Zahir Balaporia, Chris ...