2168 search results - page 60 / 434 » Randomized Algorithms and Complexity Theory |
135
click to vote
STOC
2009
ACM
16 years 3 months ago
2009
ACM
We present an improved oracle for the distance sensitivity problem. The goal is to preprocess a directed graph G = (V, E) with non-negative edge weights to answer queries of the f...
124
click to vote
SPAA
2005
ACM
15 years 8 months ago
2005
ACM
We study oblivious routing in which the packet paths are constructed independently of each other. We give a simple oblivious routing algorithm for geometric networks in which the ...
109
click to vote
DIALM
2008
ACM
15 years 4 months ago
2008
ACM
If V is a set of n points in the unit square [0, 1]2 , and if R : V + is an assignment of positive real numbers (radii) to to those points, define a graph G(R) as follows: {v, w}...
150
click to vote
SASN
2004
ACM
15 years 8 months ago
2004
ACM
Key management is one of the fundamental building blocks of security services. In a network with resource constrained nodes like sensor networks, traditional key management techni...
139
click to vote
VMV
2001
15 years 4 months ago
2001
This contribution presents a new class of MRF, that is inspired by methods of statistical physics. The new energy function assumes full-connectivity in the neighborhood system and...