3874 search results - page 326 / 775 » Approximation Algorithms for k-hurdle Problems |
157
click to vote
SIGIR
2009
ACM
15 years 11 months ago
2009
ACM
This paper explores the problem of computing pairwise similarity on document collections, focusing on the application of “more like this” queries in the life sciences domain. ...
170
click to vote
CVPR
2010
IEEE
16 years 1 months ago
2010
IEEE
Maximum a posteriori (MAP) inference in Markov Random Fields (MRFs) is an NP-hard problem, and thus research has focussed on either finding efficiently solvable subclasses (e.g. t...
171
click to vote
RECOMB
2006
Springer
16 years 5 months ago
2006
Springer
This paper proposes a parameterized algorithm for aligning two protein structures, in the case where one protein structure is represented by a contact map graph and the other by a ...
162
Voted
JCC
2006
15 years 5 months ago
2006
: This article describes a method for solving the geometric closure problem for simplified models of nucleic acid structures by using the constant bond lengths approximation. The r...
171
click to vote
FOIKS
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. We give a general framework for approximate query processing in semistructured databases. We focus on regular path queries, which are the integral part of most of the que...