2542 search results - page 74 / 509 » Computing Cartograms with Optimal Complexity |
100
Voted
SPAA
2009
ACM
15 years 11 months ago
2009
ACM
Cache-oblivious algorithms have the advantage of achieving good sequential cache complexity across all levels of a multi-level cache hierarchy, regardless of the specifics (cache...
104
click to vote
CORR
2006
Springer
15 years 2 months ago
2006
Springer
Let S = s1, s2, s3, ..., sn be a given vector of n distinct real numbers. The rank of z R with respect to S is defined as the number of elements si S such that si z. We consider...
124
Voted
EUROCRYPT
1997
Springer
15 years 6 months ago
1997
Springer
In this paper we present a new multi-authority secret-ballot election scheme that guarantees privacy, universal verifiability, and robustness. It is the first scheme for which the ...
128
click to vote
AFRICACRYPT
2010
Springer
15 years 9 months ago
2010
Springer
Abstract. The most costly operations encountered in pairing computations are those that take place in the full extension field Fpk . At high levels of security, the complexity of ...
117
click to vote
PPSN
1994
Springer
15 years 6 months ago
1994
Springer
A general model for the coevolution of cooperating species is presented. This model is instantiated and tested in the domain of function optimization, and compared with a tradition...