215 search results - page 16 / 43 » Indeterminacy and Rough Approximation |
AAIM
2010
Springer
13 years 12 months ago
2010
Springer
We present a polynomial-time approximation algorithm for legally coloring as many edges of a given simple graph as possible using two colors. It achieves an approximation ratio of...
MOC
2002
13 years 8 months ago
2002
We consider finite element operators defined on "rough" functions in a bounded polyhedron in RN . Insisting on preserving positivity in the approximations, we discover a...
RSCTC
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. We introduce an automated multi-spectral MRI segmentation technique based on approximate reducts derived from the data mining paradigm of the theory of rough sets. We uti...
FUIN
2002
13 years 8 months ago
2002
We use information entropy measure to extend the rough set based notion of a reduct. We introduce the Approximate Entropy Reduction Principle (AERP). It states that any simplificat...
SPAA
2004
ACM
14 years 2 months ago
2004
ACM
We consider the problem of partitioning a graph into k components of roughly equal size while minimizing the capacity of the edges between different components of the cut. In part...