597 search results - page 16 / 120 » Homomorphisms of random paths |
IPPS
2006
IEEE
15 years 3 months ago
2006
IEEE
A general approach to achieve anonymity on P2P networks is to construct an indirect path between client and server for each data transfer. The indirection, together with randomnes...
IPPS
2005
IEEE
15 years 3 months ago
2005
IEEE
— In the oblivious path selection problem, each packet in the network independently chooses a path, which is an important property if the routing algorithm is to be independent o...
67
Voted
KDD
1995
ACM
15 years 1 months ago
1995
ACM
Random errors and insufficiencies in databases limit the performance of any classifier trained from and applied to the database. In this paper we propose a method to estimate the ...
IOLTS
2000
IEEE
15 years 2 months ago
2000
IEEE
The combination of higher quality requirements and sensitivity of high performance circuits to delay defects has led to an increasing emphasis on delay testing of VLSI circuits. A...
INFOCOM
2007
IEEE
15 years 3 months ago
2007
IEEE
— In this paper, we analyze the impact of straight line routing in large homogeneous multi-hop wireless networks. We estimate the nodal load, which is defined as the number of p...