Sciweavers

1941 search results - page 43 / 389
» On Generalizations of Network Design Problems with Degree Bo...
Sort
View
DSN
2006
IEEE
15 years 3 months ago
The Startup Problem in Fault-Tolerant Time-Triggered Communication
Fault-tolerant time-triggered communication relies on the synchronization of local clocks. The startup problem is the problem of reaching a sufficient degree of synchronization a...
Wilfried Steiner, Hermann Kopetz
INFOCOM
2010
IEEE
14 years 8 months ago
Analyzing Nonblocking Switching Networks using Linear Programming (Duality)
Abstract—The main task in analyzing a switching network design (including circuit-, multirate-, and photonic-switching) is to determine the minimum number of some switching compo...
Hung Q. Ngo, Atri Rudra, Anh N. Le, Thanh-Nhan Ngu...
MFCS
2010
Springer
14 years 7 months ago
Weights of Exact Threshold Functions
We consider Boolean exact threshold functions defined by linear equations, and in general degree d polynomials. We give upper and lower bounds on the maximum magnitude (absolute va...
László Babai, Kristoffer Arnsfelt Ha...
TWC
2008
193views more  TWC 2008»
14 years 9 months ago
Coverage for target localization in wireless sensor networks
Target tracking and localization are important applications in wireless sensor networks. Although the coverage problem for target detection has been intensively studied, few consi...
Wei Wang 0002, Vikram Srinivasan, Bang Wang, Kee C...
AAAI
2008
15 years 2 days ago
Bounding the False Discovery Rate in Local Bayesian Network Learning
Modern Bayesian Network learning algorithms are timeefficient, scalable and produce high-quality models; these algorithms feature prominently in decision support model development...
Ioannis Tsamardinos, Laura E. Brown