1469 search results - page 106 / 294 » Characterizing the Structural Complexity of Real-World Compl... |
124
Voted
MST
1998
15 years 3 months ago
1998
We de ne the sharply bounded hierarchy, SBH(QL), a hierarchy of classes within P, using quasilinear-time computation and quanti cation over strings of length logn. It generalizes ...
146
Voted
WICON
2008
15 years 5 months ago
2008
Cognitive radio networks that allow dynamic spectrum access are considered spectrally more efficient than networks using fixed spectral allocation. These networks are characterize...
133
Voted
ICC
2008
IEEE
15 years 10 months ago
2008
IEEE
— The complexity of current Internet applications makes the understanding of network traffic a challenging task. By providing larger-scale aggregates for analysis, unsupervised ...
140
Voted
ISCIS
2005
Springer
15 years 9 months ago
2005
Springer
Dense subgraphs of sparse graphs (communities), which appear in most real-world complex networks, play an important role in many contexts. Computing them however is generally expe...
119
Voted
ICIW
2008
IEEE
15 years 10 months ago
2008
IEEE
Abstract—Peer-to-Peer (P2P) systems are widely used for sharing digital items without structured metadata and in absence of any kind of digital rights management applied to the d...