Sciweavers

873 search results - page 129 / 175
» E-voting: Dependability Requirements and Design for Dependab...
Sort
View
TIT
2008
103views more  TIT 2008»
14 years 11 months ago
Fast Distributed Algorithms for Computing Separable Functions
The problem of computing functions of values at the nodes in a network in a fully distributed manner, where nodes do not have unique identities and make decisions based only on loc...
Damon Mosk-Aoyama, Devavrat Shah
TSP
2008
151views more  TSP 2008»
14 years 11 months ago
Convergence Analysis of Reweighted Sum-Product Algorithms
Markov random fields are designed to represent structured dependencies among large collections of random variables, and are well-suited to capture the structure of real-world sign...
Tanya Roosta, Martin J. Wainwright, Shankar S. Sas...
COR
2004
111views more  COR 2004»
14 years 11 months ago
Multiple multicast tree allocation in IP network
The multicasting is defined as the distribution of the same information stream from one to many nodes concurrently. There has been an intensive research effort to design protocols...
Chae Y. Lee, Hee K. Cho
COMCOM
2000
95views more  COMCOM 2000»
14 years 11 months ago
Countermeasures for mobile agent security
: Security is an important issue for the widespread deployment of applications based on software agent technology. It is generally agreed that without the proper countermeasures in...
Wayne A. Jansen
ALGORITHMICA
1999
112views more  ALGORITHMICA 1999»
14 years 11 months ago
Suffix Trees on Words
We discuss an intrinsic generalization of the suffix tree, designed to index a string of length n which has a natural partitioning into m multicharacter substrings or words. This ...
Arne Andersson, N. Jesper Larsson, Kurt Swanson