Sciweavers

1629 search results - page 261 / 326
» Hardness Results and Efficient Algorithms for Graph Powers
Sort
View
BMCBI
2007
265views more  BMCBI 2007»
14 years 10 months ago
Large scale clustering of protein sequences with FORCE -A layout based heuristic for weighted cluster editing
Background: Detecting groups of functionally related proteins from their amino acid sequence alone has been a long-standing challenge in computational genome research. Several clu...
Tobias Wittkop, Jan Baumbach, Francisco P. Lobo, S...
CF
2006
ACM
15 years 1 months ago
The potential of the cell processor for scientific computing
The slowing pace of commodity microprocessor performance improvements combined with ever-increasing chip power demands has become of utmost concern to computational scientists. As...
Samuel Williams, John Shalf, Leonid Oliker, Shoaib...
ICAIL
2003
ACM
15 years 3 months ago
Improving Legal Quality - an application report
Problems with legal quality will not only increase effort and costs of the law enforcement organisations, but also undermines the regulating power of the legislator. Unintended us...
Tom M. van Engers, Margherita R. Boekenoogen
DLS
2007
150views Languages» more  DLS 2007»
15 years 1 months ago
RPython: a step towards reconciling dynamically and statically typed OO languages
Although the C-based interpreter of Python is reasonably fast, implementations on the CLI or the JVM platforms offers some advantages in terms of robustness and interoperability. ...
Davide Ancona, Massimo Ancona, Antonio Cuni, Nicho...
DATE
2009
IEEE
155views Hardware» more  DATE 2009»
15 years 1 months ago
Automatically mapping applications to a self-reconfiguring platform
The inherent reconfigurability of SRAM-based FPGAs enables the use of configurations optimized for the problem at hand. Optimized configurations are smaller and faster than their g...
Karel Bruneel, Fatma Abouelella, Dirk Stroobandt