2542 search results - page 10 / 509 » Computing Cartograms with Optimal Complexity |
APL
1998
ACM
13 years 12 months ago
1998
ACM
This article describes how array predicates were used to reduce the computational complexity of four APL primitive functions when one of their arguments is a permutation vector. T...
ICC
2007
IEEE
14 years 1 months ago
2007
IEEE
— This paper addresses a low complexity frequency offset estimator for multiple-input multiple-output (MIMO) orthogonal frequency division multiplexing (OFDM) systems over freque...
PODC
2011
ACM
12 years 10 months ago
2011
ACM
We study the time-complexity of robust atomic read/write storage from fault-prone storage components in asynchronous message-passing systems. Robustness here means wait-free tolera...
POPL
2003
ACM
14 years 8 months ago
2003
ACM
Given a program and two variables p and q, the goal of points-to analysis is to check if p can point to q in some execution of the program. This well-studied problem plays a cruci...
EOR
2008
13 years 7 months ago
2008
We review complexity results for minimizing polynomials over the standard simplex and unit hypercube. In addition, we derive new results on the computational complexity of approxi...