Sciweavers

7259 search results - page 46 / 1452
» From Fields to Trees
Sort
View
JCT
2006
110views more  JCT 2006»
13 years 8 months ago
Branch-width, parse trees, and monadic second-order logic for matroids
Abstract. We introduce "matroid parse trees" which, using only a limited amount of information at each node, can build up the vector representations of matroids of bounde...
Petr Hlinený
RECOMB
2007
Springer
14 years 8 months ago
Minimizing and Learning Energy Functions for Side-Chain Prediction
Abstract. Side-chain prediction is an important subproblem of the general protein folding problem. Despite much progress in side-chain prediction, performance is far from satisfact...
Chen Yanover, Ora Schueler-Furman, Yair Weiss
MFCS
2005
Springer
14 years 1 months ago
Nondeterministic Graph Searching: From Pathwidth to Treewidth
Abstract. We introduce nondeterministic graph searching with a controlled amount of nondeterminism and show how this new tool can be used in algorithm design and combinatorial anal...
Fedor V. Fomin, Pierre Fraigniaud, Nicolas Nisse
ACL
2009
13 years 5 months ago
Topological Field Parsing of German
Freer-word-order languages such as German exhibit linguistic phenomena that present unique challenges to traditional CFG parsing. Such phenomena produce discontinuous constituents...
Jackie Chi Kit Cheung, Gerald Penn
CISS
2007
IEEE
14 years 5 hour ago
Energy Efficient Routing for Statistical Inference of Markov Random Fields
The problem of routing of sensor observations for optimal detection of a Markov random field (MRF) at a designated fusion center is analyzed. Assuming that the correlation structur...
Animashree Anandkumar, Lang Tong, Ananthram Swami