836 search results - page 148 / 168 » Orthogonal Colorings of Graphs |
136
click to vote
PG
2000
IEEE
15 years 6 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...
102
click to vote
FOCS
1993
IEEE
15 years 5 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...
142
click to vote
CCS
2008
ACM
15 years 3 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
15 years 1 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 ...
113
Voted
JCT
2010
15 years 5 days ago
2010
The vertex Folkman number F(r, n, m), n < m, is the smallest integer t such that there exists a Km-free graph of order t with the property that every r-coloring of its vertices...