Sciweavers

2877 search results - page 57 / 576
» The Complexity of Planarity Testing
Sort
View
JSC
2006
81views more  JSC 2006»
13 years 9 months ago
Complexity bounds for zero-test algorithms
In this paper, we analyze the complexity of a zero test for expressions built from formal power series solutions of first order differential equations with non degenerate initial ...
Joris van der Hoeven, John Shackell
BMCBI
2007
102views more  BMCBI 2007»
13 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...
ICMENS
2003
IEEE
127views Hardware» more  ICMENS 2003»
14 years 2 months ago
Design and Fabrication of Microchannels for Magnetohydrodynamic Flow
This paper introduces a new microchannel design for magnetohydrodynamic (MHD) flow that maximizes MHD pumping power. An electromagnetic channel (EMC), which has a rectangular cros...
Jian-Bin Bao, D. Jed Harrison
WCE
2007
13 years 10 months ago
Determination of the Position and Orientation of Rigid Bodies by Using Single Camera Images
- This study aims to present a new reconstruction method which enables reconstruction of 3D configuration of an object using single camera images. A secondary planar target which i...
Varlik Kilic, Bulent E. Platin
JC
2002
63views more  JC 2002»
13 years 8 months ago
On the Complexity of Exclusion Algorithms for Optimization
Exclusion algorithms are a well-known tool in the area of interval analysis for finding all solutions of a system of nonlinear equations or for finding the global minimum of a fun...
Eugene L. Allgower, Melissa Erdmann, Kurt Georg