Sciweavers

9736 search results - page 81 / 1948
» How Fast Can We Compute Products
Sort
View
CIKM
2005
Springer
15 years 10 months ago
Opportunity map: a visualization framework for fast identification of actionable knowledge
Data mining techniques frequently find a large number of patterns or rules, which make it very difficult for a human analyst to interpret the results and to find the truly interes...
Kaidi Zhao, Bing Liu, Thomas M. Tirpak, Weimin Xia...
VLSID
2006
IEEE
86views VLSI» more  VLSID 2006»
16 years 5 months ago
Partial Product Reduction Based on Look-Up Tables
In this paper a new technique for partial product reduction based on the use of look-up tables for efficient processing is presented. We describe how to construct counter devices ...
F. Pujol López, Higinio Mora Mora, Jer&oacu...
VAMOS
2010
Springer
15 years 3 months ago
Optimizing Non-functional Properties of Software Product Lines by means of Refactorings
Abstract—Today, software product line engineering concentrates on tailoring the functionality of programs. However, we and others observed an increasing interest in non-functiona...
Norbert Siegmund, Martin Kuhlemann, Mario Pukall, ...
ICPP
2009
IEEE
15 years 11 months ago
Complexity Analysis and Performance Evaluation of Matrix Product on Multicore Architectures
The multicore revolution is underway, bringing new chips introducing more complex memory architectures. Classical algorithms must be revisited in order to take the hierarchical me...
Mathias Jacquelin, Loris Marchal, Yves Robert
DAC
2004
ACM
15 years 10 months ago
Extending the transaction level modeling approach for fast communication architecture exploration
System-on-Chip (SoC) designs are increasingly becoming more complex. Efficient on-chip communication architectures are critical for achieving desired performance in these systems....
Sudeep Pasricha, Nikil D. Dutt, Mohamed Ben-Romdha...