Sciweavers

736 search results - page 66 / 148
» Confidence-Aware Join Algorithms
Sort
View
SCESM
2006
ACM
239views Algorithms» more  SCESM 2006»
15 years 6 months ago
Aspect-oriented software design with a variant of UML/STD
The notion of aspect is important as a systematic approach to the representation of cross-cutting concerns and the incremental additions of new functionalities to an existing syst...
Shin Nakajima, Tetsuo Tamai
WDAG
2004
Springer
122views Algorithms» more  WDAG 2004»
15 years 6 months ago
Active and Concurrent Topology Maintenance
A central problem for structured peer-to-peer networks is topology maintenance, that is, how to properly update neighbor variables when nodes join and leave the network, possibly c...
Xiaozhou Li, Jayadev Misra, C. Greg Plaxton
99
Voted
JOIN
2007
91views more  JOIN 2007»
15 years 13 days ago
An Optimal Rebuilding Strategy for an Incremental Tree Problem
This paper is devoted to the following incremental problem. Initially, a graph and a distinguished subset of vertices, called initial group, are given. This group is connected by ...
Nicolas Thibault, Christian Laforest
116
Voted
BMCBI
2010
123views more  BMCBI 2010»
15 years 21 days ago
Decoding HMMs using the k best paths: algorithms and applications
Background: Traditional algorithms for hidden Markov model decoding seek to maximize either the probability of a state path or the number of positions of a sequence assigned to th...
Daniel G. Brown 0001, Daniil Golod
PE
2002
Springer
158views Optimization» more  PE 2002»
15 years 6 days ago
Comparison of inter-area rekeying algorithms for secure wireless group communications
Many emerging mobile wireless applications depend upon secure group communications, in which data is encrypted and the group's data encryption key is changed whenever a membe...
Chun Zhang, Brian DeCleene, James F. Kurose, Donal...