2272 search results - page 108 / 455 » Capture Complexity by Partition |
COCO
2007
Springer
15 years 4 months ago
2007
Springer
Antunes, Fortnow, van Melkebeek and Vinodchandran captured the notion of non-random information by computational depth, the difference between the polynomialtime-bounded Kolmogoro...
CGF
1999
14 years 9 months ago
1999
This paper describes the successful combination of pre-generated and dynamically updated image-based representations to accelerate the visualization of complex virtual environment...
ICCD
2006
IEEE
15 years 6 months ago
2006
IEEE
Abstract— In this paper, we describe the design and implementation of the primary memory system of the TRIPS processor. To match the aggressive execution bandwidth and support hi...
IPPS
2008
IEEE
15 years 4 months ago
2008
IEEE
An architectural framework is studied that can perform dynamic reconfiguration. A basic objective is to dynamically reconfigure the architecture so that its configuration is well ...
FSTTCS
2007
Springer
15 years 4 months ago
2007
Springer
We consider computational problems on covering graphs with bicliques (complete bipartite subgraphs). Given a graph and an integer k, the biclique cover problem asks whether the edg...