Join Our Newsletter
350 search results - page 70 / 70 » Branching Programs for Tree Evaluation |
STACS
1999
Springer
13 years 2 months ago
1999
Springer
Abstract. We consider dynamic evaluation of algebraic functions (matrix multiplication, determinant, convolution, Fourier transform, etc.) in the model of Reif and Tate; i.e., if f...
BMCBI
2010
12 years 10 months ago
2010
Background: The incorporation of annotated sequence information from multiple related species in commonly used databases (Ensembl, Flybase, Saccharomyces Genome Database, Wormbase...
JAIR
2007
12 years 9 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ļ¬...
SDM
2011
SIAM
12 years 17 days ago
2011
SIAM
In many real world prediction problems the output is a structured object like a sequence or a tree or a graph. Such problems range from natural language processing to computationa...
CVPR
2012
IEEE
11 years 5 days ago
2012
IEEE
A large number of problems in computer vision can be modeled as energy minimization problems in a markov random ļ¬eld (MRF) framework. Many methods have been developed over the y...
