5592 search results - page 1020 / 1119 » On Random Betweenness Constraints |
143
click to vote
SPAA
2003
ACM
15 years 9 months ago
2003
ACM
We propose a new approach for constructing P2P networks based on a dynamic decomposition of a continuous space into cells corresponding to servers. We demonstrate the power of thi...
140
click to vote
WSNA
2003
ACM
15 years 9 months ago
2003
ACM
Motivated by realistic sensor network scenarios that have mis-informed nodes and variable network topologies, we propose a fundamentally different approach to routing that combine...
133
Voted
AUSAI
2003
Springer
15 years 9 months ago
2003
Springer
An important task in machine learning is determining which learning algorithm works best for a given data set. When the amount of data is small the same data needs to be used repea...
140
click to vote
DRM
2003
Springer
15 years 9 months ago
2003
Springer
In PODC 2003, Park, Chong, Siegel and Ray [22] proposed an optimistic protocol for fair exchange, based on RSA signatures. We show that their protocol is totally breakable already...
139
Voted
FCT
2003
Springer
15 years 9 months ago
2003
Springer
The purpose of this paper is to investigate the properties of a certain class of highly visible spaces. For a given geometric space C containing obstacles specified by disjoint s...