2370 search results - page 145 / 474 » A Structured Set of Higher-Order Problems |
144
Voted
PODC
2010
ACM
15 years 5 months ago
2010
ACM
We give a graph decomposition technique that creates entirely independent subproblems for graph problems such as coloring and dominating sets that can be solved without synchroniz...
120
Voted
ISSS
1995
IEEE
15 years 7 months ago
1995
IEEE
This paper examines the problem of code-generation for expression trees on non-homogeneous register set architectures. It proposes and proves the optimality of an O(n) algorithm f...
152
Voted
IWOCA
2010
Springer
14 years 10 months ago
2010
Springer
We consider here the problem of chaining seeds in ordered trees. Seeds are mappings between two trees Q and T and a chain is a subset of non overlapping seeds that is consistent wi...
139
Voted
CORR
2012
Springer
13 years 11 months ago
2012
Springer
The problem of learning the structure of Bayesian networks from complete discrete data with a limit on parent set size is considered. Learning is cast explicitly as an optimisatio...
120
click to vote
ICML
2007
IEEE
16 years 4 months ago
2007
IEEE
In this paper, we survey the current state-ofart models for structured learning problems, including Hidden Markov Model (HMM), Conditional Random Fields (CRF), Averaged Perceptron...