5607 search results - page 808 / 1122 » Graph structure in the Web |
174
click to vote
ICN
2005
Springer
16 years 8 days ago
2005
Springer
It is shown that the de Bruijn graph (dBG) can be used as an architecture for interconnection networks and a suitable structure for parallel computation. Recent works have classi...
177
click to vote
WEA
2005
Springer
16 years 7 days ago
2005
Springer
Ordered Binary Decision Diagrams (OBDDs) are a data structure for Boolean functions which supports many useful operations. It finds applications in CAD, model checking, and symbol...
186
click to vote
DIALM
2004
ACM
16 years 6 days ago
2004
ACM
In this paper, we consider energy-efficient gathering of correlated data in sensor networks. We focus on single-input coding strategies in order to aggregate correlated data. For ...
165
click to vote
ISAAC
2004
Springer
16 years 4 days ago
2004
Springer
Assuming 3-SAT formulas are hard to refute with high probability, Feige showed approximation hardness results, among others for the max bipartite clique. We extend this result in t...
222
click to vote
WOMPAT
2004
Springer
16 years 3 days ago
2004
Springer
A program analysis tool can play an important role in helping users understand and improve OpenMP codes. Dragon is a robust interactive program analysis tool based on the Open64 co...