1474 search results - page 154 / 295 » Exploiting Locality in a TMS |
155
click to vote
PPSN
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. The rooted delay-constrained minimum spanning tree problem is an NP-hard combinatorial optimization problem arising for example in the design of centralized broadcasting ...
180
click to vote
TIP
2010
15 years 2 months ago
2010
—Lossless compression of encrypted sources can be achieved through Slepian-Wolf coding. For encrypted real-world sources such as images, the key to improve the compression effici...
131
click to vote
EMNLP
2010
15 years 2 months ago
2010
In this paper, we investigate how modeling content structure can benefit text analysis applications such as extractive summarization and sentiment analysis. This follows the lingu...
146
click to vote
GLOBECOM
2010
IEEE
15 years 2 months ago
2010
IEEE
In this paper, we propose a novel routing protocol, PRO, for profile-based routing in pocket switched networks. Differing from previous routing protocols, PRO treats node encounter...
143
click to vote
IPPS
2010
IEEE
15 years 2 months ago
2010
IEEE
Abstract--Loop tiling is an important compiler transformation used for enhancing data locality and exploiting coarsegrained parallelism. Tiled codes in which tile sizes are runtime...