1486 search results - page 74 / 298 » Algorithms for two-box covering |
112
click to vote
RC
2007
15 years 3 months ago
2007
Abstract. “Computing the pessimism” means bounding the overestimation produced by an inclusion function. There are two important distinctions with classical error analysis. Fir...
138
Voted
TOG
2002
15 years 3 months ago
2002
We present a multi-scale algorithm for mapping a texture defined by an input image onto an arbitrary surface. It avoids the generation and storage of a new, specific texture. The ...
154
Voted
ICDM
2009
IEEE
15 years 1 months ago
2009
IEEE
Multispectral remote sensing images are widely used for automated land use and land cover classification tasks. Remotely sensed images usually cover large geographical areas, and s...
105
click to vote
GC
2002
Springer
15 years 3 months ago
2002
Springer
It is shown that the Hilbert series of the face ring of a clique complex (equivalently, flag complex) of a graph G is, up to a factor, just a specialization of SG (x, y), the subg...
121
Voted
ECAI
2000
Springer
15 years 8 months ago
2000
Springer
This paper proposes new algorithms for the Binate Covering Problem (BCP), a well-known restriction of Boolean Optimization. Binate Covering finds application in many areas of Com...