Sciweavers

2629 search results - page 39 / 526
» complex 2009
Sort
View
CIKM
2009
Springer
14 years 4 months ago
Role of weak ties in link prediction of complex networks
Plenty of algorithms for link prediction have been proposed and were applied to various real networks. Among these works, the weights of links are rarely taken into account. In th...
Linyuan Lu, Tao Zhou
COCO
2009
Springer
124views Algorithms» more  COCO 2009»
14 years 4 months ago
The Maximum Communication Complexity of Multi-Party Pointer Jumping
—We study the one-way number-on-the-forhead (NOF) communication complexity of the k-layer pointer jumping problem. Strong lower bounds for this problem would have important impli...
Joshua Brody
ICCS
2009
Springer
14 years 4 months ago
Towards a Complex Automata Multiscale Model of In-Stent Restenosis
Abstract. In-stent restenosis, the maladaptive response of a blood vessel to injury caused by the deployment of a stent, is a multiscale problem involving a large number of process...
Alfonso Caiazzo, David Evans, Jean-Luc Falcone, Ja...
CDC
2009
IEEE
126views Control Systems» more  CDC 2009»
14 years 2 months ago
The standard parts problem and the complexity of control communication
The objective of the standard parts optimal control problem is to find a number, m, of control inputs to a given input-output system that can be used in different combinations to...
John Baillieul, Wing Shing Wong
COCO
2009
Springer
106views Algorithms» more  COCO 2009»
14 years 4 months ago
Increasing the Gap between Descriptional Complexity and Algorithmic Probability
The coding theorem is a fundamental result of algorithmic information theory. A well known theorem of G´acs shows that the analog of the coding theorem fails for continuous sample...
Adam R. Day