Sciweavers

Share
350 search results - page 70 / 70
» Branching Programs for Tree Evaluation
Sort
View
STACS
1999
Springer
13 years 3 months ago
Lower Bounds for Dynamic Algebraic Problems
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...
Gudmund Skovbjerg Frandsen, Johan P. Hansen, Peter...
BMCBI
2010
145views more  BMCBI 2010»
12 years 11 months ago
JCoDA: a tool for detecting evolutionary selection
Background: The incorporation of annotated sequence information from multiple related species in commonly used databases (Ensembl, Flybase, Saccharomyces Genome Database, Wormbase...
Steven N. Steinway, Ruth Dannenfelser, Christopher...
JAIR
2007
132views more  JAIR 2007»
12 years 11 months ago
New Inference Rules for Max-SAT
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ļ¬...
Chu Min Li, Felip Manyà, Jordi Planes
SDM
2011
SIAM
232views Data Mining» more  SDM 2011»
12 years 2 months ago
A Sequential Dual Method for Structural SVMs
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...
Shirish Krishnaj Shevade, Balamurugan P., S. Sunda...
CVPR
2012
IEEE
11 years 2 months ago
A tiered move-making algorithm for general pairwise MRFs
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...
Vibhav Vineet, Jonathan Warrell, Philip H. S. Torr
books