1208 search results - page 149 / 242 » On Counting Generalized Colorings |
79
Voted
OOPSLA
2005
Springer
15 years 3 months ago
2005
Springer
Currently, the most adopted criterion to invoke garbage collection is heap space exhaustion. In other words, garbage collection is invoked when the heap space (either the entire s...
CF
2004
ACM
15 years 3 months ago
2004
ACM
This paper discusses fault-tolerant techniques for SRAM-based FPGAs. These techniques can be based on circuit level modifications, with obvious modifications in the programmable a...
SAC
2004
ACM
15 years 3 months ago
2004
ACM
Most of the complexity of common data mining tasks is due to the unknown amount of information contained in the data being mined. The more patterns and correlations are contained ...
97
Voted
SLIP
2004
ACM
15 years 3 months ago
2004
ACM
Throughput, power consumption, signal integrity, pin count and routing complexity are all increasingly important interconnect issues that the system designer must deal with. Recen...
70
Voted
ESA
2004
Springer
15 years 3 months ago
2004
Springer
For planar graphs, counting the number of perfect matchings (and hence determining whether there exists a perfect matching) can be done in NC [4, 10]. For planar bipartite graphs, ...