2542 search results - page 85 / 509 » Computing Cartograms with Optimal Complexity |
128
click to vote
CASES
2009
ACM
15 years 7 months ago
2009
ACM
Nanowire crossbar circuits are an emerging architectural paradigm that promises a higher integration density and an improved fault-tolerance due to its reconfigurability. In this...
115
click to vote
ICC
2009
IEEE
15 years 9 months ago
2009
IEEE
— The design and analysis of capacity-approaching input signalling for optical intensity channels are presented. Both peak and average optical power constraints are considered in...
124
Voted
ICALP
2005
Springer
15 years 8 months ago
2005
Springer
Motivated by the study of algorithmic problems in the domain of information security, in this paper, we study the complexity of a new class of computations over a collection of va...
115
click to vote
DAM
2007
15 years 2 months ago
2007
Given A := {a1, . . . , am} ⊂ Rd whose affine hull is Rd, we study the problems of computing an approximate rounding of the convex hull of A and an approximation to the minimum ...
128
click to vote
CRYPTO
2007
Springer
15 years 8 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...