7015 search results - page 343 / 1403 » Approximation algorithms for co-clustering |
156
click to vote
CAGD
2004
15 years 6 months ago
2004
Topologically consistent algorithms for the intersection and trimming of free-form parametric surfaces are of fundamental importance in computer-aided design, analysis, and manufa...
178
click to vote
IJKESDP
2010
15 years 5 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 ...
159
click to vote
JGO
2010
15 years 5 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...
175
click to vote
CVPR
1998
IEEE
16 years 8 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...
322
click to vote
ICDE
2003
IEEE
16 years 8 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...