5592 search results - page 199 / 1119 » On Random Betweenness Constraints |
192
click to vote
SASN
2004
ACM
15 years 11 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...
182
click to vote
APPROX
2008
Springer
15 years 8 months ago
2008
Springer
Let H be a graph, and let CH(G) be the number of (subgraph isomorphic) copies of H contained in a graph G. We investigate the fundamental problem of estimating CH(G). Previous res...
155
click to vote
CDC
2008
IEEE
16 years 18 days ago
2008
IEEE
— We come up with novel quantized averaging algorithms on synchronous and asynchronous communication networks with fixed, switching and random topologies. The implementation of ...
140
Voted
RANDOM
2001
Springer
15 years 10 months ago
2001
Springer
We study Euclidean embeddings of Euclidean metrics and present the following four results: (1) an O(log3 n √ log log n) approximation for minimum bandwidth in conjunction with a ...
296
click to vote
POPL
2003
ACM
16 years 6 months ago
2003
ACM
We present a new polynomial-time randomized algorithm for discovering affine equalities involving variables in a program. The key idea of the algorithm is to execute a code fragme...