Sciweavers

492 search results - page 90 / 99
» The number of possibilities for random dating
Sort
View
WPES
2004
ACM
14 years 2 months ago
Privacy preserving route planning
The number of location-aware mobile devices has been rising for several years. As this trend continues, these devices may be able to use their location information to provide inte...
Keith B. Frikken, Mikhail J. Atallah
ISAAC
2004
Springer
84views Algorithms» more  ISAAC 2004»
14 years 2 months ago
Property-Preserving Data Reconstruction
We initiate a new line of investigation into online property-preserving data reconstruction. Consider a dataset which is assumed to satisfy various (known) structural properties; e...
Nir Ailon, Bernard Chazelle, Seshadhri Comandur, D...
INFOCOM
2003
IEEE
14 years 2 months ago
A Framework for Reliable Routing in Mobile Ad Hoc Networks
— Mobile ad hoc networks consist of nodes that are often vulnerable to failure. As such, it is important to provide redundancy in terms of providing multiple nodedisjoint paths f...
Zhenqiang Ye, Srikanth V. Krishnamurthy, Satish K....
SPAA
2003
ACM
14 years 2 months ago
A practical algorithm for constructing oblivious routing schemes
In a (randomized) oblivious routing scheme the path chosen for a request between a source s and a target t is independent from the current traffic in the network. Hence, such a sc...
Marcin Bienkowski, Miroslaw Korzeniowski, Harald R...
ATAL
2003
Springer
14 years 2 months ago
Towards a pareto-optimal solution in general-sum games
Multiagent learning literature has investigated iterated twoplayer games to develop mechanisms that allow agents to learn to converge on Nash Equilibrium strategy profiles. Such ...
Sandip Sen, Stéphane Airiau, Rajatish Mukhe...