3466 search results - page 284 / 694 » Fast computation of special resultants |
167
click to vote
ANTSW
2004
Springer
16 years 6 days ago
2004
Springer
Designing an optimal overlay communication network for a set of processes on the Internet is a central problem of peer-to-peer (P2P) computing. Such a network defines membership a...
147
Voted
OOPSLA
1997
Springer
15 years 10 months ago
1997
Springer
A type inclusion test determines whether one type is a subtype of another. Efficient type testing techniques exist for single subtyping, but not for languages with multiple subtyp...
171
click to vote
ESA
2008
Springer
15 years 8 months ago
2008
Springer
In this paper, we study two fast algorithms--HashRF and PGM-Hashed--for computing the Robinson-Foulds (RF) distance matrix between a collection of evolutionary trees. The RF distan...
177
click to vote
CSREASAM
2008
15 years 8 months ago
2008
Abstract--Packet Level Authentication (PLA) is a novel countermeasure against distributed denial-of-service attacks. Each packet sent across a network has a digital signature and p...
208
click to vote
PDPTA
2000
15 years 8 months ago
2000
Networked UNIX workstations as well as workstations running Windows 98 and Windows NT are fast becoming the standard computing environments at many universities and research sites....