10608 search results - page 201 / 2122 » Complexity of O'Hara's Algorithm |
IPM
2006
13 years 10 months ago
2006
The Pathfinder algorithm is widely used to prune social networks. The pruning maintains the geodesic distances between nodes. It has shown itself to be very useful in the analysis...
CIBCB
2008
IEEE
14 years 5 months ago
2008
IEEE
— Molecular docking is an essential tool for drug design. It helps the scientist to rapidly know if two molecules, respectively called ligand and receptor, can be combined togeth...
ISCAS
2007
IEEE
14 years 5 months ago
2007
IEEE
— The complexity of Finite Impulse Response (FIR) filters is dominated by the number of adders (subtractors) used to implement the coefficient multipliers. A greedy Common Subexp...
IAT
2006
IEEE
14 years 4 months ago
2006
IEEE
In this paper, we propose a novel approach to solving the distributed constraint optimisation problem (DCOP) that guarantees completeness, while having linear communication comple...
INFOVIS
2002
IEEE
14 years 3 months ago
2002
IEEE
Many clustering and layout techniques have been used for structuring and visualising complex data. This paper is inspired by a number of such contemporary techniques and presents ...