Sciweavers

197 search results - page 18 / 40
» On the Existence of Large Sets of t-designs of Prime Sizes
Sort
View
FPGA
2007
ACM
150views FPGA» more  FPGA 2007»
14 years 1 months ago
FPGA-friendly code compression for horizontal microcoded custom IPs
Shrinking time-to-market and high demand for productivity has driven traditional hardware designers to use design methodologies that start from high-level languages. However, meet...
Bita Gorjiara, Daniel Gajski
DATE
2007
IEEE
99views Hardware» more  DATE 2007»
14 years 1 months ago
Instruction trace compression for rapid instruction cache simulation
Modern Application Specific Instruction Set Processors (ASIPs) have customizable caches, where the size, associativity and line size can all be customized to suit a particular ap...
Andhi Janapsatya, Aleksandar Ignjatovic, Sri Param...
TCAD
2008
201views more  TCAD 2008»
13 years 7 months ago
Bitmask-Based Code Compression for Embedded Systems
Embedded systems are constrained by the available memory. Code-compression techniques address this issue by reducing the code size of application programs. It is a major challenge ...
Seok-Won Seong, Prabhat Mishra
CIKM
2009
Springer
14 years 2 months ago
Fragment-based clustering ensembles
Clustering ensembles combine different clustering solutions into a single robust and stable one. Most of existing methods become highly time-consuming when the data size turns to ...
Ou Wu, Mingliang Zhu, Weiming Hu
EDBT
2009
ACM
131views Database» more  EDBT 2009»
13 years 10 months ago
Sample synopses for approximate answering of group-by queries
With the amount of data in current data warehouse databases growing steadily, random sampling is continuously gaining in importance. In particular, interactive analyses of large d...
Philipp Rösch, Wolfgang Lehner