1629 search results - page 230 / 326 » Hardness Results and Efficient Algorithms for Graph Powers |
CORR
2010
Springer
14 years 10 months ago
2010
Springer
The usefulness of parameterized algorithmics has often depended on what Niedermeier has called, "the art of problem parameterization." In this paper we introduce and expl...
IWCMC
2006
ACM
15 years 3 months ago
2006
ACM
Securing multicast communications in ad hoc networks has become one of the most challenging research directions in the areas of wireless networking and security. This is especiall...
DAC
2005
ACM
15 years 11 months ago
2005
ACM
Achieving design closure is one of the biggest headaches for modern VLSI designers. This problem is exacerbated by high-level design automation tools that ignore increasingly impo...
ICC
2007
IEEE
15 years 4 months ago
2007
IEEE
—This paper aims to address the problem of inter-cell interference fluctuation, which is inherent on the uplink direction of future cellular systems employing OFDMA or single car...
ICWS
2010
IEEE
14 years 11 months ago
2010
IEEE
Data intensive applications, e.g. in life sciences, pose new efficiency challenges to the service composition problem. Since today computing power is mainly increased by multiplica...