5592 search results - page 767 / 1119 » On Random Betweenness Constraints |
196
click to vote
IPTPS
2005
Springer
16 years 11 days ago
2005
Springer
Abstract— Peer-to-peer (P2P) worms exploit common vulnerabilities in member hosts of a P2P network and spread topologically in the P2P network, a potentially more effective strat...
189
click to vote
ISAAC
2005
Springer
16 years 11 days ago
2005
Springer
Binary search trees are one of the most fundamental data structures. While the height of such a tree may be linear in the worst case, the average height with respect to the uniform...
175
Voted
IWDW
2005
Springer
16 years 11 days ago
2005
Springer
In this paper, we present a watermarking based approach, and its implementation, for mitigating phishing attacks - a form of web based identity theft. ViWiD is an integrity check m...
156
click to vote
MMMACNS
2005
Springer
16 years 10 days ago
2005
Springer
Abstract. This paper presents a method to generate unique and nevertheless highly random pseudonyms in a distributed environment. More precisely, each user can now generate his pse...
158
click to vote
SARA
2005
Springer
16 years 10 days ago
2005
Springer
Sets of features in Markov decision processes can play a critical role ximately representing value and in abstracting the state space. Selection of features is crucial to the succe...