4451 search results - page 825 / 891 » On Random Ordering Constraints |
APPROX
2010
Springer
13 years 10 months ago
2010
Springer
Abstract. Given a directed graph G = (V, E) and an integer k 1, a ktransitive-closure-spanner (k-TC-spanner) of G is a directed graph H = (V, EH ) that has (1) the same transitive...
SDM
2008
SIAM
13 years 10 months ago
2008
SIAM
In this paper we explore private computation built on vector addition and its applications in privacypreserving data mining. Vector addition is a surprisingly general tool for imp...
SODA
2008
ACM
13 years 10 months ago
2008
ACM
We show a tight lower bound of (N log log N) on the number of transmission required to compute the parity of N bits (with constant error) in a network of N randomly placed sensors...
WSC
2001
13 years 10 months ago
2001
This paper investigates the dimensionality characteristics of the outcome space of a combat simulation. The independent state variables of all of the outcome states for a simulati...
MASCOTS
2003
13 years 10 months ago
2003
In this paper, we present a scheme for minimizing packet loss in OSPF networks by optimizing link weights using Online Simulation. We have chosen packet loss rate in the network a...