239 search results - page 37 / 48 » Searching Protein 3-D Structures in Linear Time |
JMLR
2008
13 years 7 months ago
2008
We propose a highly efficient framework for penalized likelihood kernel methods applied to multiclass models with a large, structured set of classes. As opposed to many previous a...
IR
2008
13 years 7 months ago
2008
A compressed full-text self-index for a text T , of size u, is a data structure used to search for patterns P, of size m, in T , that requires reduced space, i.e. space that depend...
IJCAI
2003
13 years 9 months ago
2003
Identifying and breaking the symmetries of CNF formulae has been shown to lead to significant reductions in search times. In this paper we describe a more systematic and efficient...
ICML
2007
IEEE
14 years 8 months ago
2007
IEEE
Neighbor search is a fundamental task in machine learning, especially in classification and retrieval. Efficient nearest neighbor search methods have been widely studied, with the...
CIKM
2009
Springer
14 years 2 months ago
2009
Springer
Many applications in structure matching require the ability to search for graphs that are similar to a query graph, i.e., similarity graph queries. Prior works, especially in chem...