Sciweavers

337 search results - page 61 / 68
» Efficient algorithms for ranking with SVMs
Sort
View
CIKM
2008
Springer
13 years 9 months ago
Learning latent semantic relations from clickthrough data for query suggestion
For a given query raised by a specific user, the Query Suggestion technique aims to recommend relevant queries which potentially suit the information needs of that user. Due to th...
Hao Ma, Haixuan Yang, Irwin King, Michael R. Lyu
BMCBI
2010
153views more  BMCBI 2010»
13 years 7 months ago
MimoSA: a system for minimotif annotation
Background: Minimotifs are short peptide sequences within one protein, which are recognized by other proteins or molecules. While there are now several minimotif databases, they a...
Jay Vyas, Ronald J. Nowling, Thomas Meusburger, Da...
ISMB
1994
13 years 8 months ago
Predicting Location and Structure Of beta-Sheet Regions Using Stochastic Tree Grammars
We describe and demonstrate the effectiveness of a method of predicting protein secondary structures, sheet regions in particular, using a class of stochastic tree grammars as rep...
Hiroshi Mamitsuka, Naoki Abe
CONSTRAINTS
2010
126views more  CONSTRAINTS 2010»
13 years 7 months ago
Lexicographically-ordered constraint satisfaction problems
Abstract. We describe a simple CSP formalism for handling multi-attribute preference problems with hard constraints, one that combines hard constraints and preferences so the two a...
Eugene C. Freuder, Robert Heffernan, Richard J. Wa...
SIGIR
2008
ACM
13 years 7 months ago
A new probabilistic retrieval model based on the dirichlet compound multinomial distribution
The classical probabilistic models attempt to capture the Ad hoc information retrieval problem within a rigorous probabilistic framework. It has long been recognized that the prim...
Zuobing Xu, Ram Akella