Sciweavers

837 search results - page 65 / 168
» Hard combinators
Sort
View
EUROPAR
2007
Springer
15 years 6 months ago
Compositional Approach Applied to Loop Specialization
An optimizing compiler has a hard time to generate a code which will perform at top speed for an arbitrary data set size. In general, the low level optimization process must take i...
Lamia Djoudi, Jean-Thomas Acquaviva, Denis Barthou
HPCC
2007
Springer
15 years 6 months ago
Parallel Genetic Algorithms for DVS Scheduling of Distributed Embedded Systems
Many of today’s embedded systems, such as wireless and portable devices rely heavily on the limited power supply. Therefore, energy efficiency becomes one of the major design con...
Man Lin, Chen Ding
PAKDD
2007
ACM
166views Data Mining» more  PAKDD 2007»
15 years 6 months ago
gPrune: A Constraint Pushing Framework for Graph Pattern Mining
In graph mining applications, there has been an increasingly strong urge for imposing user-specified constraints on the mining results. However, unlike most traditional itemset co...
Feida Zhu, Xifeng Yan, Jiawei Han, Philip S. Yu
PKDD
2007
Springer
143views Data Mining» more  PKDD 2007»
15 years 6 months ago
Using the Web to Reduce Data Sparseness in Pattern-Based Information Extraction
Textual patterns have been used effectively to extract information from large text collections. However they rely heavily on textual redundancy in the sense that facts have to be m...
Sebastian Blohm, Philipp Cimiano
WABI
2007
Springer
109views Bioinformatics» more  WABI 2007»
15 years 6 months ago
A Novel Method for Signal Transduction Network Inference from Indirect Experimental Evidence
In this paper we introduce a new method of combined synthesis and inference of biological signal transduction networks. A main idea of our method lies in representing observed cau...
Réka Albert, Bhaskar DasGupta, Riccardo Don...