Sciweavers

6202 search results - page 25 / 1241
» Without Loss of Generality
Sort
View
RECOMB
2010
Springer
14 years 7 months ago
An Efficient Algorithm for Gene/Species Trees Parsimonious Reconciliation with Losses, Duplications and Transfers
(Motivation) Tree reconciliation is an approach that explains the discrepancies between two evolutionary trees by a number of events such as speciations, duplications, transfers an...
Jean-Philippe Doyon, Celine Scornavacca, K. Yu. Go...
CCS
2009
ACM
15 years 10 months ago
Quantifying maximal loss of anonymity in protocols
There is a natural intuitive match between anonymity and information theory. In particular, the maximal anonymity loss in anonymity protocols can be matched to the information the...
Han Chen, Pasquale Malacaria
PODC
2009
ACM
15 years 10 months ago
Correctness of gossip-based membership under message loss
Due to their simplicity and effectiveness, gossip-based membership protocols have become the method of choice for maintaining partial membership in large P2P systems. A variety of...
Maxim Gurevich, Idit Keidar
ALT
2004
Springer
15 years 6 months ago
Relative Loss Bounds and Polynomial-Time Predictions for the k-lms-net Algorithm
We consider a two-layer network algorithm. The first layer consists of an uncountable number of linear units. Each linear unit is an LMS algorithm whose inputs are first “kerne...
Mark Herbster
MM
2009
ACM
163views Multimedia» more  MM 2009»
15 years 4 months ago
Peer-assisted packet loss repair for IPTV video multicast
Emerging IPTV technology uses source-specific IP multicast to deliver TV programs to the end-users. To provide timely and reliable services over the error-prone DSL access networ...
Zhi Li, Xiaoqing Zhu, Ali C. Begen, Bernd Girod