Sciweavers

155 search results - page 23 / 31
» Reducing Design Complexity of the Load Store Queue
Sort
View
CCCG
2009
15 years 1 months ago
Enumeration of Polyominoes for p4 Tiling
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...
Takashi Horiyama, Masato Samejima
ICIP
2009
IEEE
14 years 9 months ago
A contrario hierarchical image segmentation
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...
Juan Cardelino, Vicent Caselles, Marcelo Bertalm&i...
MIDDLEWARE
2005
Springer
15 years 5 months ago
Composite Subscriptions in Content-Based Publish/Subscribe Systems
Distributed publish/subscribe systems are naturally suited for processing events in distributed systems. However, support for expressing patterns about disparate events and algorit...
Guoli Li, Hans-Arno Jacobsen
DEXA
2006
Springer
139views Database» more  DEXA 2006»
15 years 3 months ago
Distributed Continuous Range Query Processing on Moving Objects
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...
Haojun Wang, Roger Zimmermann, Wei-Shinn Ku
HPCA
2005
IEEE
15 years 5 months ago
Microarchitectural Wire Management for Performance and Power in Partitioned Architectures
Future high-performance billion-transistor processors are likely to employ partitioned architectures to achieve high clock speeds, high parallelism, low design complexity, and low...
Rajeev Balasubramonian, Naveen Muralimanohar, Kart...