1404 search results - page 44 / 281 » On General Laws of Complex Networks |
IWCMC
2006
ACM
15 years 5 months ago
2006
ACM
Space time convolutional codes (STCCs) are an effective way to combine transmit diversity with coding. The computational complexity of designing STCCs generally increases exponent...
BIB
2007
14 years 12 months ago
2007
An overview is presented of the construction and use of algebraic partition functions to represent the equilibrium statistical mechanics of multimolecular complexes and their acti...
ECBS
2009
IEEE
15 years 6 months ago
2009
IEEE
Sensornet lifespan and utility is limited by the energy resources of individual motes. Network designers seek to maximise energy efficiency while maintaining acceptable Quality o...
104
click to vote
AAIM
2005
Springer
15 years 5 months ago
2005
Springer
Let G be a undirected connected graph. Given a set of g groups each being a subset of V (G), tree routing and coloring is to produce g trees in G and assign a color to each of them...
CIAC
2010
Springer
15 years 3 months ago
2010
Springer
A flow on a directed network is said to be confluent if the flow uses at most one outgoing arc at each node. Confluent flows arise naturally from destination-based routing. We stud...