Sciweavers

3247 search results - page 219 / 650
» Randomized smoothing networks
Sort
View
IPSN
2005
Springer
15 years 10 months ago
Sensing capacity for discrete sensor network applications
We bound the number of sensors required to achieve a desired level of sensing accuracy in a discrete sensor network application (e.g. distributed detection). We model the state of...
Yaron Rachlin, Rohit Negi, Pradeep K. Khosla
JSW
2007
106views more  JSW 2007»
15 years 4 months ago
Destabilization of Terrorist Networks through Argument Driven Hypothesis Model
— Social network analysis has been used for quite some time to analyze and understand the behavior of nodes in the network. Theses nodes could be individuals or group of persons,...
Dil Muhammad Akbar Hussain
SODA
2010
ACM
173views Algorithms» more  SODA 2010»
16 years 2 months ago
Distributed Agreement with Optimal Communication Complexity
We consider the problem of fault-tolerant agreement in a crash-prone synchronous system. We present a new randomized consensus algorithm that achieves optimal communication effici...
Seth Gilbert, Dariusz Kowalski
WAW
2009
Springer
138views Algorithms» more  WAW 2009»
15 years 11 months ago
Information Theoretic Comparison of Stochastic Graph Models: Some Experiments
The Modularity-Q measure of community structure is known to falsely ascribe community structure to random graphs, at least when it is naively applied. Although Q is motivated by a ...
Kevin J. Lang
ICRA
2003
IEEE
147views Robotics» more  ICRA 2003»
15 years 10 months ago
Modular petri net based modeling, analysis and synthesis of dedicated production systems
−−−− Ordinary t-timed Petri Nets are used for modeling, analysis and synthesis of random topology production systems and networks. Each production system is first decompose...
George J. Tsinarakis, Kimon P. Valavanis, Nikos Ts...