4009 search results - page 607 / 802 » Clustering on Complex Graphs |
167
click to vote
VLDB
1990
ACM
15 years 10 months ago
1990
ACM
Therequirementsfor amain memorydatastoragemodel are both compactnessand efficient processing for all database operations. The DBGraph storage model, proposed in this paper, achiev...
140
click to vote
CAEPIA
2007
Springer
15 years 10 months ago
2007
Springer
Many recent successful planners use domain-independent heuristics to speed up the search for a valid plan. An orthogonal approach to accelerating search is to identify and remove r...
151
click to vote
AAECC
2006
Springer
15 years 10 months ago
2006
Springer
We study the design of structured Tanner codes with low error-rate floors on the AWGN channel. The design technique involves the "doping" of standard LDPC (proto-)graphs,...
177
click to vote
DATE
2004
IEEE
15 years 10 months ago
2004
IEEE
Many high-end DSP processors employ both multiple memory banks and heterogeneous register files to improve performance and power consumption. The complexity of such architectures ...
196
click to vote
FDL
2004
IEEE
15 years 10 months ago
2004
IEEE
The steadily increasing complexity of embedded systems requires comprehensive methodoloat support the design process from the highest possible abstraction level. In most of the cu...