68 search results - page 12 / 14 » Efficient Pairing Computation with Theta Functions |
INFOCOM
2002
IEEE
13 years 11 months ago
2002
IEEE
—Open Shortest Path First (OSPF) is a popular protocol for routing within an autonomous system (AS) domain. In order to scale for large networks containing hundreds and thousands...
RECOMB
2006
Springer
14 years 6 months ago
2006
Springer
Computational and comparative analysis of protein-protein interaction (PPI) networks enable understanding of the modular organization of the cell through identification of functio...
ICCV
2005
IEEE
14 years 8 months ago
2005
IEEE
Object identification (OID) is specialized recognition where the category is known (e.g. cars) and the algorithm recognizes an object's exact identity (e.g. Bob's BMW). ...
BMCBI
2004
13 years 5 months ago
2004
Background: Parallel computing is frequently used to speed up computationally expensive tasks in Bioinformatics. Results: Herein, a parallel version of the multi-alignment program...
BMCBI
2005
13 years 5 months ago
2005
Background: Synthetic lethality experiments identify pairs of genes with complementary function. More direct functional associations (for example greater probability of membership...