Sciweavers

6224 search results - page 821 / 1245
» Recent Advances in Networking
Sort
View
AAAI
2000
15 years 8 months ago
Semantics and Inference for Recursive Probability Models
In recent years, there have been several proposals that extend the expressive power of Bayesian networks with that of relational models. These languages open the possibility for t...
Avi Pfeffer, Daphne Koller
CORR
2010
Springer
74views Education» more  CORR 2010»
15 years 7 months ago
Conflict-Free Coloring and its Applications
Let H = (V, E) be a hypergraph. A conflict-free coloring of H is an assignment of colors to V such that in each hyperedge e E there is at least one uniquely-colored vertex. This ...
Shakhar Smorodinsky
CORR
2006
Springer
161views Education» more  CORR 2006»
15 years 7 months ago
Consensus Propagation
We propose consensus propagation, an asynchronous distributed protocol for averaging numbers across a network. We establish convergence, characterize the convergence rate for regul...
Ciamac Cyrus Moallemi, Benjamin Van Roy
ISI
2008
Springer
15 years 6 months ago
Secure remote control model for information appliances
Abstract--Recently, Lee et al. proposed a Remote Authentication Model of Information Appliances (RAMIA). Unfortunately, RAMIA has a fatal error that opens the entire home network o...
Wen-Gong Shieh, Jian-Min Wang, Wen-Bing Horng
JPDC
2006
134views more  JPDC 2006»
15 years 6 months ago
Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs
Minimum Spanning Tree (MST) is one of the most studied combinatorial problems with practical applications in VLSI layout, wireless communication, and distributed networks, recent ...
David A. Bader, Guojing Cong