1887 search results - page 276 / 378 » An efficient search algorithm for partially ordered sets |
EACL
2006
ACL Anthology
13 years 9 months ago
2006
ACL Anthology
I propose a uniform approach to the elimination of redundancy in CCG lexicons, where grammars incorporate inheritance hierarchies of lexical types, defined over a simple, feature-...
CPM
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. Protein structure analysis is one of the most important research issues in the post-genomic era, and faster and more accurate query data structures for such 3-D structure...
SIGIR
2008
ACM
13 years 7 months ago
2008
ACM
With an explosive growth of blogs, information seeking in blogosphere becomes more and more challenging. One example task is to find the most relevant topical blogs against a give...
SIGMOD
1996
ACM
14 years 1 days ago
1996
ACM
Magic sets rewriting is a well-known optimization heuristic for complex decision-support queries. There can be many variants of this rewriting even for a single query, which diffe...
CCO
2001
Springer
14 years 12 days ago
2001
Springer
Branch, cut, and price (BCP) is an LP-based branch and bound technique for solving large-scale discrete optimization problems (DOPs). In BCP, both cuts and variables can be generat...