2157 search results - page 252 / 432 » Optimal Fast Hashing |
146
Voted
PUK
2000
15 years 4 months ago
2000
Progressive processing plans allow systems to tradeoff computational resources against the quality of service by specifying alternative ways in which to accomplish each step. When ...
104
click to vote
GECCO
2008
Springer
15 years 4 months ago
2008
Springer
In this paper we present a novel intrusion detection architecture based on Idiotypic Network Theory (INIDS), that aims at dealing with large scale network attacks featuring variab...
146
Voted
CGF
2006
15 years 3 months ago
2006
We propose a novel surface remeshing algorithm. While many remeshing algorithms are based on global parametrization or local mesh optimization, our algorithm is closely related to...
115
click to vote
CORR
2006
Springer
15 years 3 months ago
2006
Springer
We show that the neighbor-joining algorithm is a robust quartet method for constructing trees from distances. This leads to a new performance guarantee that contains Atteson's...
131
click to vote
TON
2008
15 years 2 months ago
2008
Given a set of demands between pairs of nodes, we examine the traffic engineering problem of flow routing and fair bandwidth allocation where flows can be split to multiple paths ...