Sciweavers

331 search results - page 59 / 67
» Comparing Reductions to NP-Complete Sets
Sort
View
SODA
2010
ACM
235views Algorithms» more  SODA 2010»
14 years 4 months ago
Algorithmic Lower Bounds for Problems Parameterized by Clique-width
Many NP-hard problems can be solved efficiently when the input is restricted to graphs of bounded tree-width or clique-width. In particular, by the celebrated result of Courcelle,...
Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtano...
HPDC
2010
IEEE
13 years 8 months ago
Cloud computing paradigms for pleasingly parallel biomedical applications
Cloud computing offers new approaches for scientific computing that leverage the major commercial hardware and software investment in this area. Closely coupled applications are s...
Thilina Gunarathne, Tak-Lon Wu, Judy Qiu, Geoffrey...
GECCO
2003
Springer
129views Optimization» more  GECCO 2003»
14 years 18 days ago
Inherent Fault Tolerance in Evolved Sorting Networks
This poster paper summarizes our research on fault tolerance arising as a by-product of the evolutionary computation process. Past research has shown evidence of robustness emergin...
Rob Shepherd, James A. Foster
CVPR
2010
IEEE
14 years 3 months ago
Pareto Discriminant Analysis
Linear Discriminant Analysis (LDA) is a popular tool for multiclass discriminative dimensionality reduction. However, LDA suffers from two major problems: (1) It only optimizes th...
Karim Abou-Moustafa, Fernando De la Torre, Frank F...
DATE
2009
IEEE
159views Hardware» more  DATE 2009»
14 years 2 months ago
Design and implementation of a database filter for BLAST acceleration
— BLAST is a very popular Computational Biology algorithm. Since it is computationally expensive it is a natural target for acceleration research, and many reconfigurable archite...
Panagiotis Afratis, Constantinos Galanakis, Euripi...