2542 search results - page 32 / 509 » Computing Cartograms with Optimal Complexity |
CRYPTO
2012
Springer
11 years 10 months ago
2012
Springer
We propose a general multiparty computation protocol secure against an active adversary corrupting up to n−1 of the n players. The protocol may be used to compute securely arithm...
ICDE
2012
IEEE
11 years 10 months ago
2012
IEEE
—Shortest distance query between two nodes is a fundamental operation in large-scale networks. Most existing methods in the literature take a landmark embedding approach, which s...
DCOSS
2011
Springer
12 years 7 months ago
2011
Springer
—To overcome the limitations of specific positioning techniques for mobile wireless nodes and achieve a high accuracy, the fusion of heterogeneous sensor information is an appea...
AGI
2008
13 years 9 months ago
2008
Universal induction solves in principle the problem of choosing a prior to achieve optimal inductive inference. The AIXI theory, which combines control theory and universal induct...
ICCMS
2009
13 years 5 months ago
2009
The simulation of chemical reacting systems is one of the most challenging topics in Systems Biology, due to their complexity and inherent randomness. The Gillespie's Stochas...