572 search results - page 74 / 115 » Exponential-Time Approximation of Hard Problems |
128
click to vote
CG
2006
Springer
15 years 2 months ago
2006
Springer
Mesh deformation techniques that preserve the differential properties have been intensively studied. In this paper, we propose an equality-constrained least squares approach for s...
98
Voted
STOC
2004
ACM
16 years 2 months ago
2004
ACM
A flow is said to be confluent if at any node all the flow leaves along a single edge. Given a directed graph G with k sinks and non-negative demands on all the nodes of G, we con...
119
Voted
COCOON
2009
Springer
15 years 9 months ago
2009
Springer
Given a set of positive integers S, we consider the problem of finding a minimum cardinality set of positive integers X (called a minimum 2-generating set of S) s.t. every element...
150
click to vote
UAI
1998
15 years 3 months ago
1998
In recent years there has been a flurry of works on learning Bayesian networks from data. One of the hard problems in this area is how to effectively learn the structure of a beli...
122
Voted
CORR
2011
Springer
14 years 9 months ago
2011
Springer
We describe a new variational lower-bound on the minimum energy configuration of a planar binary Markov Random Field (MRF). Our method is based on adding auxiliary nodes to every...