764 search results - page 14 / 153 » Reputable Mix Networks |
NETWORKS
2010
13 years 6 months ago
2010
We show that the mixed search number and the linear-width of interval graphs and of split graphs can be computed in linear time and in polynomial time, respectively.
CHI
2003
ACM
14 years 8 months ago
2003
ACM
Designing for trust in technology-mediated interaction is an increasing concern in CHI. In advertising, images of people have long been used to create positive attitudes to produc...
GCC
2007
Springer
14 years 1 months ago
2007
Springer
As various kinds of peer-to-peer (P2P) applications become popular and widely known to people all around the world, research on P2P networks has received considerable interest. Re...
ISCC
2005
IEEE
14 years 1 months ago
2005
IEEE
— The main characterisrics of ad hoc networks are the lack of predefined infrastructure and the dynamic topology. These characteristics present some new security vulnerabilities...
TKDE
2008
13 years 7 months ago
2008
Abstract-- In peer-to-peer (P2P) networks, reputation aggregation and peer ranking are the most time-consuming and spacedemanding operations. This paper proposes a gossip-based rep...