Sciweavers

909 search results - page 151 / 182
» Performance Evaluation of the VF Graph Matching Algorithm
Sort
View
IWCMC
2006
ACM
14 years 2 months ago
Modeling key agreement in multi-hop ad hoc networks
Securing multicast communications in ad hoc networks has become one of the most challenging research directions in the areas of wireless networking and security. This is especiall...
Giovanni Di Crescenzo, Maria Striki, John S. Baras
BMCBI
2010
178views more  BMCBI 2010»
13 years 8 months ago
An improved method for scoring protein-protein interactions using semantic similarity within the Gene Ontology
Background: Semantic similarity measures are useful to assess the physiological relevance of protein-protein interactions (PPIs). They quantify similarity between proteins based o...
Shobhit Jain, Gary D. Bader
KDD
2007
ACM
184views Data Mining» more  KDD 2007»
14 years 8 months ago
Dynamic hybrid clustering of bioinformatics by incorporating text mining and citation analysis
To unravel the concept structure and dynamics of the bioinformatics field, we analyze a set of 7401 publications from the Web of Science and MEDLINE databases, publication years 1...
Bart De Moor, Frizo A. L. Janssens, Wolfgang Gl&au...
MM
2006
ACM
180views Multimedia» more  MM 2006»
14 years 2 months ago
Fast tracking of near-duplicate keyframes in broadcast domain with transitivity propagation
The identification of near-duplicate keyframe (NDK) pairs is a useful task for a variety of applications such as news story threading and content-based video search. In this pape...
Chong-Wah Ngo, Wanlei Zhao, Yu-Gang Jiang
ESA
2004
Springer
129views Algorithms» more  ESA 2004»
14 years 1 months ago
Contraction and Treewidth Lower Bounds
Edge contraction is shown to be a useful mechanism to improve lower bound heuristics for treewidth. A successful lower bound for treewidth is the degeneracy: the maximum over all ...
Hans L. Bodlaender, Arie M. C. A. Koster, Thomas W...