155 search results - page 23 / 31 » Reducing Design Complexity of the Load Store Queue |
CCCG
2009
13 years 9 months ago
2009
Polyominoes are the two dimensional shapes made by connecting n unit squares, joined along their edges. In this paper, we propose algorithms to enumerate polyominoes for p4 tiling...
ICIP
2009
IEEE
13 years 5 months ago
2009
IEEE
Hierarchies are a powerful tool for image segmentation, they produce a multiscale representation which allows to design robust algorithms and can be stored in tree-like structures...
MIDDLEWARE
2005
Springer
14 years 1 months ago
2005
Springer
Distributed publish/subscribe systems are naturally suited for processing events in distributed systems. However, support for expressing patterns about disparate events and algorit...
DEXA
2006
Springer
13 years 11 months ago
2006
Springer
Recent work on continuous queries has focused on processing queries in very large, mobile environments. In this paper, we propose a system leveraging the computing capacities of mo...
HPCA
2005
IEEE
14 years 1 months ago
2005
IEEE
Future high-performance billion-transistor processors are likely to employ partitioned architectures to achieve high clock speeds, high parallelism, low design complexity, and low...