15485 search results - page 645 / 3097 » Computing Optimal Subsets |
187
click to vote
SIGCSE
2008
ACM
15 years 7 months ago
2008
ACM
We have designed and implemented game-themed programming assignment modules targeted specifically for adoption in existing introductory programming classes. These assignments are ...
174
click to vote
BSL
2005
15 years 7 months ago
2005
A mass problem is a set of Turing oracles. If P and Q are mass problems, we say that P is weakly reducible to Q if every member of Q Turing computes a member of P. We say that P i...
188
Voted
COMGEO
2004
ACM
15 years 7 months ago
2004
ACM
We show how to utilize the cactus representation of all minimum cuts of a graph to visualize the minimum cuts of a planar graph in a planar drawing. In a first approach the cactus...
197
click to vote
GC
2002
Springer
15 years 7 months ago
2002
Springer
A mixed hypergraph is a triple H = (X, C, D), where X is the vertex set, and each of C, D is a list of subsets of X. A strict k-coloring of H is a surjection c : X {1, . . . , k}...
185
click to vote
SAC
2008
ACM
15 years 6 months ago
2008
ACM
Leakage power in cache memories represents a sizable fraction of total power consumption, and many techniques have been proposed to reduce it. As a matter of fact, during a fixed ...