7129 search results - page 363 / 1426 » Approximation Algorithms for Treewidth |
141
click to vote
IJKESDP
2010
15 years 3 months ago
2010
—This paper considers k-minimum spanning tree problems. An existing solution algorithm based on tabu search, which was proposed by Katagiri et al., includes an iterative solving ...
128
Voted
JGO
2010
15 years 3 months ago
2010
The purpose of this paper is to investigate the problem of finding a common element of the set of fixed points F(S) of a nonexpansive mapping S and the set of solutions ΩA of t...
137
click to vote
CVPR
1998
IEEE
16 years 6 months ago
1998
IEEE
Markov Random Fields (MRF's) can be used for a wide variety of vision problems. In this paper we focus on MRF's with two-valued clique potentials, which form a generaliz...
270
click to vote
ICDE
2003
IEEE
16 years 6 months ago
2003
IEEE
XML data integration tools are facing a variety of challenges for their efficient and effective operation. Among these is the requirement to handle a variety of inconsistencies or...
124
click to vote
ICML
2009
IEEE
16 years 5 months ago
2009
IEEE
Recent approaches to learning structured predictors often require approximate inference for tractability; yet its effects on the learned model are unclear. Meanwhile, most learnin...