2125 search results - page 225 / 425 » On Graph Complexity |
116
Voted
ICCSA
2010
Springer
15 years 5 months ago
2010
Springer
This paper achieves O(n3 log log n/ log n) time for the 2center problems on a directed graph with non-negative edge costs under the conventional RAM model where only arithmetic ope...
141
Voted
ESANN
2007
15 years 5 months ago
2007
Abstract. We propose a new algorithm for estimating the causal structure that underlies the observed dependence among n (n ≥ 4) binary variables X1, . . . , Xn. Our inference pri...
142
Voted
ATAL
2009
Springer
15 years 10 months ago
2009
Springer
Multiagent systems are often characterized by complex, and sometimes unpredictable interactions amongst their autonomous components. While these systems can provide robust and sca...
137
click to vote
CRYPTO
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. We study the natural problem of secure n-party computation (in the passive, computationally unbounded attack model) of the n-product function fG(x1, . . . , xn) = x1 · x...
120
Voted
CORR
2008
Springer
15 years 3 months ago
2008
Springer
Linearity tests are randomized algorithms which have oracle access to the truth table of some function f, and are supposed to distinguish between linear functions and functions whi...