This paper describes a kernel based Web Services (abbreviated as service) matching mechanism for service discovery and integration. The matching mechanism tries to exploit the lat...
Yu Jianjun, Guo Shengmin, Su Hao, Zhang Hui, Xu Ke
There has been an increased interest in design of that it can give better performance, if a modified noise broadband (data rate >IMSPS) delta sigma ADCs with over- transfer func...
A. K. Gupta, E. Sanchez-Sinencio, S. Karthikeyan, ...
Searching bio-chemical structures is becoming an important application domain of information retrieval. This paper introduces a protein structure matching problem and formulates i...
A common limitation of many retrieval models, including the recently proposed axiomatic approaches, is that retrieval scores are solely based on exact (i.e., syntactic) matching o...
: Scalable Distributed Data Structures (SDDSs) store large scalable files over a distributed RAM of nodes in a grid or a P2P network. The files scale transparently for the applicat...