Sciweavers

2020 search results - page 88 / 404
» Speeding up Slicing
Sort
View
ESCIENCE
2006
IEEE
14 years 4 months ago
Grid Approach to Embarrassingly Parallel CPU-Intensive Bioinformatics Problems
Bioinformatics algorithms such as sequence alignment methods based on profile-HMM (Hidden Markov Model) are popular but CPU-intensive. If large amounts of data are processed, a s...
Heinz Stockinger, Marco Pagni, Lorenzo Cerutti, La...
FSKD
2005
Springer
180views Fuzzy Logic» more  FSKD 2005»
14 years 3 months ago
An Effective Feature Selection Scheme via Genetic Algorithm Using Mutual Information
Abstract. In the artificial neural networks (ANNs), feature selection is a wellresearched problem, which can improve the network performance and speed up the training of the networ...
Chunkai K. Zhang, Hong Hu
HIPEAC
2005
Springer
14 years 3 months ago
A Practical Method for Quickly Evaluating Program Optimizations
This article aims at making iterative optimization practical and usable by speeding up the evaluation of a large range of optimizations. Instead of using a full run to evaluate a s...
Grigori Fursin, Albert Cohen, Michael F. P. O'Boyl...
VLDB
2005
ACM
122views Database» more  VLDB 2005»
14 years 3 months ago
Optimizing Nested Queries with Parameter Sort Orders
Nested iteration is an important technique for query evaluation. It is the default way of executing nested subqueries in SQL. Although decorrelation often results in cheaper non-n...
Ravindra Guravannavar, H. S. Ramanujam, S. Sudarsh...
ASPDAC
2004
ACM
118views Hardware» more  ASPDAC 2004»
14 years 3 months ago
Fast and efficient voltage scheduling by evolutionary slack distribution
- To minimize energy consumption by voltage scaling in design of heterogeneousreal-time embeddedsystems, it is necessary to perfom two distinct tasks: task scheduling (TS) and volt...
Bita Gorjiara, Pai H. Chou, Nader Bagherzadeh, Meh...