762 search results - page 135 / 153 » Strategic Coloring of a Graph |
CVPR
2000
IEEE
15 years 1 months ago
2000
IEEE
We use cluster analysis as a unifying principle for problems from low, middle and high level vision. The clustering problem is viewed as graph partitioning, where nodes represent ...
102
click to vote
PG
2000
IEEE
15 years 1 months ago
2000
IEEE
This paper presents solutions to the feature correspondence and feature interpolation problems in image morphing. The user specifies the correspondence between the source and the...
FOCS
1993
IEEE
15 years 1 months ago
1993
IEEE
This paper investigates the computational complexity of approximating several NPoptimization problems using the number of queries to an NP oracle as a complexity measure. The resu...
CCS
2008
ACM
14 years 11 months ago
2008
ACM
We propose an approach for the selective enforcement of access control restrictions in, possibly distributed, large data collections based on two basic concepts: i) flexible autho...
TC
1998
14 years 9 months ago
1998
—Many built-in self-testing (BIST) schemes compress the test responses from a k-output circuit to q signature streams, where q << k, a process termed space compaction. The ...