20 search results - page 3 / 4 » Existence Theorems and Approximation Algorithms for Generali... |
138
Voted
WS
2006
ACM
15 years 9 months ago
2006
ACM
In this paper, we propose a formal notion of network security for ad hoc networks. We adopt a probabilistic security framework, that is, security is defined by a polynomially bou...
120
Voted
COLT
2004
Springer
15 years 9 months ago
2004
Springer
: We introduce a graph-theoretic generalization of classical Arrow-Debreu economics, in which an undirected graph specifies which consumers or economies are permitted to engage in...
149
Voted
SPAA
2003
ACM
15 years 9 months ago
2003
ACM
In the minimum path coloring problem, we are given a graph and a set of pairs of vertices of the graph and we are asked to connect the pairs by colored paths in such a way that pa...
145
Voted
CCS
2009
ACM
15 years 10 months ago
2009
ACM
In mobile networks, authentication is a required primitive of the majority of security protocols. However, an adversary can track the location of mobile nodes by monitoring pseudo...
133
click to vote
WISEC
2009
ACM
15 years 10 months ago
2009
ACM
Time synchronization in highly distributed wireless systems like sensor and ad hoc networks is extremely important in order to maintain a consistent notion of time throughout the ...