65 search results - page 5 / 13 » An Approach to Graph and Netlist Compression |
KDD
2010
ACM
13 years 11 months ago
2010
ACM
Compressing social networks can substantially facilitate mining and advanced analysis of large social networks. Preferably, social networks should be compressed in a way that they...
FCCM
2002
IEEE
14 years 12 days ago
2002
IEEE
To fully realize the benefits of partial and rapid reconfiguration of field-programmable devices, we often need to dynamically schedule computing tasks and generate instance-sp...
ICCAD
1999
IEEE
13 years 11 months ago
1999
IEEE
In this paper we present new methods for fast justification and propagation in the implication graph (IG) which is the core data structure of our SAT based implication engine. As ...
ICMCS
2005
IEEE
14 years 1 months ago
2005
IEEE
In this paper, a method for content-based retrieval of JPEG images is presented, utilizing features directly from the discrete cosine transform (DCT) domain. Image indexing is ach...
DATE
2005
IEEE
14 years 1 months ago
2005
IEEE
As compared to a large spectrum of performance optimizations, relatively little effort has been dedicated to optimize other aspects of embedded applications such as memory space r...