Sciweavers

89 search results - page 6 / 18
» How Crucial is Small World Connectivity for Dynamics
Sort
View
EAAI
2008
116views more  EAAI 2008»
13 years 7 months ago
Robust neuro-identification of nonlinear plants in electric power systems with missing sensor measurements
Fault tolerant measurements are an essential requirement for system identification, control and protection. Measurements can be corrupted or interrupted due to sensor failure, bro...
Wei Qiao, Zhi Gao, Ronald G. Harley, Ganesh K. Ven...
APPROX
2006
Springer
234views Algorithms» more  APPROX 2006»
13 years 10 months ago
Constant-Factor Approximation for Minimum-Weight (Connected) Dominating Sets in Unit Disk Graphs
For a given graph with weighted vertices, the goal of the minimum-weight dominating set problem is to compute a vertex subset of smallest weight such that each vertex of the graph...
Christoph Ambühl, Thomas Erlebach, Matú...
CORR
2008
Springer
84views Education» more  CORR 2008»
13 years 7 months ago
The emerging field of language dynamics
Large linguistic databases, especially databases having a global coverage such as The World Atlas of Language Structures (Haspelmath et al. 2005), The Automated Simility Judgment ...
Søren Wichmann
NECO
2007
127views more  NECO 2007»
13 years 6 months ago
Visual Recognition and Inference Using Dynamic Overcomplete Sparse Learning
We present a hierarchical architecture and learning algorithm for visual recognition and other visual inference tasks such as imagination, reconstruction of occluded images, and e...
Joseph F. Murray, Kenneth Kreutz-Delgado
SIROCCO
2000
13 years 8 months ago
On time versus size for monotone dynamic monopolies in regular topologies
: We consider a well known distributed coloring game played on a simple connected graph: initially, each vertex is colored black or white; at each round, each vertex simultaneously...
Paola Flocchini, Rastislav Kralovic, Alessandro Ro...