2542 search results - page 28 / 509 » Computing Cartograms with Optimal Complexity |
ICSOC
2009
Springer
13 years 5 months ago
2009
Springer
With increasingly complex and heterogeneous systems in pervasive service computing, it becomes more and more important to provide self-protected services to end users. In order to ...
INFOCOM
2007
IEEE
14 years 1 months ago
2007
IEEE
— We introduce a low-complexity distributed slotted MAC protocol that can support all feasible arrival rates in a wireless backhaul network (WBN). For arbitrary wireless networks...
ERSHOV
2003
Springer
14 years 26 days ago
2003
Springer
We present several new algorithms as well as new lower and upper bounds for optimizing functions underlying infinite games pertinent to computer-aided verification.
ICCS
2001
Springer
14 years 3 days ago
2001
Springer
Abstract. Sparse matrix-vector multiplication is an important computational kernel that tends to perform poorly on modern processors, largely because of its high ratio of memory op...
IPPS
2007
IEEE
14 years 1 months ago
2007
IEEE
— We consider memory subsystem optimizations for improving the performance of sparse scientific computation while reducing the power consumed by the CPU and memory. We first co...