1199 search results - page 56 / 240 » Robust inference of trees |
206
click to vote
ISMB
1993
15 years 8 months ago
1993
Wedescribe various methods designed to discover knowledge in the GenBanknucleic acid sequence database. Using a grammatical model of gene structure, we create a parse tree of a ge...
161
click to vote
ICCD
2006
IEEE
16 years 3 months ago
2006
IEEE
— New back-end design for manufacturability rules have brought guarantee rules for interconnect matching. These rules indicate a certain capacitance matching guarantee given spac...
212
click to vote
TABLEAUX
2009
Springer
16 years 1 months ago
2009
Springer
We consider two sequent calculi for tense logic in which the syntactic judgements are nested sequents, i.e., a tree of traditional onesided sequents built from multisets of formula...
212
click to vote
HPDC
2007
IEEE
16 years 1 months ago
2007
IEEE
Adapting to the network is the key to achieving high performance for communication-intensive applications, including scientific computing, data intensive computing, and multicast...
191
click to vote
JAIR
2007
15 years 6 months ago
2007
Exact Max-SAT solvers, compared with SAT solvers, apply little inference at each node of the proof tree. Commonly used SAT inference rules like unit propagation produce a simpli...