Sciweavers

2412 search results - page 61 / 483
» Which Problems Have Strongly Exponential Complexity
Sort
View
COCOON
2008
Springer
14 years 26 days ago
Quasi-bicliques: Complexity and Binding Pairs
Abstract. Protein-protein interactions (PPIs) are one of the most important mechanisms in cellular processes. To model protein interaction sites, recent studies have suggested to f...
Xiaowen Liu, Jinyan Li, Lusheng Wang
CSR
2008
Springer
13 years 11 months ago
Colouring, constraint satisfaction, and complexity
Constraint satisfaction problems have enjoyed much attention since the early seventies, and in the last decade have become also a focus of attention amongst theoreticians. Graph c...
Pavol Hell, Jaroslav Nesetril
BMCBI
2010
232views more  BMCBI 2010»
13 years 11 months ago
LucidDraw: Efficiently visualizing complex biochemical networks within MATLAB
Background: Biochemical networks play an essential role in systems biology. Rapidly growing network data and e research activities call for convenient visualization tools to aid i...
Sheng He, Juan Mei, Guiyang Shi, Zhengxiang Wang, ...
ACL
2006
14 years 14 days ago
Factoring Synchronous Grammars by Sorting
Synchronous Context-Free Grammars (SCFGs) have been successfully exploited as translation models in machine translation applications. When parsing with an SCFG, computational comp...
Daniel Gildea, Giorgio Satta, Hao Zhang
AIEDAM
2008
127views more  AIEDAM 2008»
13 years 11 months ago
Evolving blackbox quantum algorithms using genetic programming
Although it is known that quantum computers can solve certain computational problems exponentially faster than classical computers, only a small number of quantum algorithms have ...
Ralf Stadelhofer, Wolfgang Banzhaf, Dieter Suter