Sciweavers

1522 search results - page 51 / 305
» On the Complexity of Several Haplotyping Problems
Sort
View
DMKD
2004
ACM
133views Data Mining» more  DMKD 2004»
15 years 3 months ago
Mining complex matchings across Web query interfaces
To enable information integration, schema matching is a critical step for discovering semantic correspondences of attributes across heterogeneous sources. As a new attempt, this p...
Bin He, Kevin Chen-Chuan Chang, Jiawei Han
BMCBI
2007
102views more  BMCBI 2007»
14 years 9 months ago
Setting up a large set of protein-ligand PDB complexes for the development and validation of knowledge-based docking algorithms
Background: The number of algorithms available to predict ligand-protein interactions is large and ever-increasing. The number of test cases used to validate these methods is usua...
Luis A. Diago, Persy Morell, Longendri Aguilera, E...
FUN
2010
Springer
293views Algorithms» more  FUN 2010»
15 years 2 months ago
Computational Complexity of Two-Dimensional Platform Games
Abstract. We analyze the computational complexity of various twodimensional platform games. We identify common properties of these games that allow us to state several meta-theorem...
Michal Forisek
71
Voted
BMCBI
2006
122views more  BMCBI 2006»
14 years 9 months ago
A domain-oriented approach to the reduction of combinatorial complexity in signal transduction networks
Background:Receptors and scaffold proteins possess a number of distinct domains and bind multiple partners. A common problem in modeling signaling systems arises from a combinator...
Holger Conzelmann, Julio Saez-Rodriguez, Thomas Sa...
DAC
2009
ACM
15 years 10 months ago
Handling complexities in modern large-scale mixed-size placement
In this paper, we propose an effective algorithm flow to handle largescale mixed-size placement. The basic idea is to use floorplanning to guide the placement of objects at the gl...
Jackey Z. Yan, Natarajan Viswanathan, Chris Chu