3455 search results - page 572 / 691 » Generalized Game Trees |
138
click to vote
KDD
2001
ACM
16 years 5 months ago
2001
ACM
We focus on the problem of finding patterns across two large, multidimensional datasets. For example, given feature vectors of healthy and of non-healthy patients, we want to answ...
142
click to vote
RECOMB
2005
Springer
16 years 5 months ago
2005
Springer
Abstract. In this paper, we study lower bound techniques for branchand-bound algorithms for maximum parsimony, with a focus on gene order data. We give a simple O(n3 ) time dynamic...
109
click to vote
CADE
2002
Springer
16 years 5 months ago
2002
Springer
Abstract. Finite model search for first-order logic theories is complementary to theorem proving. Systems like Falcon, SEM and FMSET use the known LNH (Least Number Heuristic) heur...
128
click to vote
STOC
2001
ACM
16 years 5 months ago
2001
ACM
We show that we can maintain up to polylogarithmic edge connectivity for a fully-dynamic graph in ~O(pn) time per edge insertion or deletion. Within logarithmic factors, this matc...
220
click to vote
SIGMOD
2009
ACM
16 years 4 months ago
2009
ACM
We demonstrate the BioNav system, a novel search interface for biomedical databases, such as PubMed. BioNav enables users to navigate large number of query results by categorizing...