Sciweavers

155 search results - page 21 / 31
» On learning linear ranking functions for beam search
Sort
View
WWW
2007
ACM
14 years 8 months ago
A kernel based structure matching for web services search
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
BIOINFORMATICS
2007
151views more  BIOINFORMATICS 2007»
13 years 7 months ago
A new protein-protein docking scoring function based on interface residue properties
Motivation: Protein–protein complexes are known to play key roles in many cellular processes. However, they are often not accessible to experimental study because of their low s...
Julie Bernauer, Jérôme Azé, Jo...
TKDE
2010
274views more  TKDE 2010»
13 years 6 months ago
Ranked Query Processing in Uncertain Databases
—Recently, many new applications, such as sensor data monitoring and mobile device tracking, raise up the issue of uncertain data management. Compared to “certain” data, the ...
Xiang Lian, Lei Chen 0002
ICML
2007
IEEE
14 years 8 months ago
Classifying matrices with a spectral regularization
We propose a method for the classification of matrices. We use a linear classifier with a novel regularization scheme based on the spectral 1-norm of its coefficient matrix. The s...
Ryota Tomioka, Kazuyuki Aihara
CIKM
2009
Springer
14 years 6 days ago
Heterogeneous cross domain ranking in latent space
Traditional ranking mainly focuses on one type of data source, and effective modeling still relies on a sufficiently large number of labeled or supervised examples. However, in m...
Bo Wang, Jie Tang, Wei Fan, Songcan Chen, Zi Yang,...