3204 search results - page 446 / 641 » The Alcuin Number of a Graph |
202
click to vote
DSN
2006
IEEE
16 years 1 months ago
2006
IEEE
This paper considers the eventual leader election problem in asynchronous message-passing systems where an arbitrary number t of processes can crash (t < n, where n is the tota...
164
click to vote
PODC
2005
ACM
16 years 16 days ago
2005
ACM
In this paper we consider the weighted, capacitated vertex cover problem with hard capacities (capVC). Here, we are given an undirected graph G = (V, E), non-negative vertex weigh...
181
click to vote
INFOCOM
2002
IEEE
15 years 12 months ago
2002
IEEE
— Most of the currently deployed multicast protocols (e.g. DVMRP, PIM, MOSPF) build one shortest path multicast tree per sender, the tree being rooted at the sender’s subnetwor...
231
click to vote
INFOCOM
2012
IEEE
13 years 9 months ago
2012
IEEE
—Distributed systems without trusted identities are particularly vulnerable to sybil attacks, where an adversary creates multiple bogus identities to compromise the running of th...
184
click to vote
ISMB
2000
15 years 8 months ago
2000
A novel description of protein structure in terms of the generalized secondary structure elements (GSSE) is proposed. GSSE's are defined as fragments of the protein structure...