Sciweavers

159 search results - page 3 / 32
» Computational Complexity of Fundamental Problems in Social C...
Sort
View
116
Voted
DATAMINE
2010
175views more  DATAMINE 2010»
14 years 10 months ago
Extracting influential nodes on a social network for information diffusion
We address the combinatorial optimization problem of finding the most influential nodes on a large-scale social network for two widely-used fundamental stochastic diffusion models...
Masahiro Kimura, Kazumi Saito, Ryohei Nakano, Hiro...
85
Voted
DNIS
2005
Springer
112views Database» more  DNIS 2005»
15 years 3 months ago
Modelling Peer-to-Peer Data Networks Under Complex System Theory
: A Peer-to-peer Data Network (PDN) is an open and evolving society of peer nodes that assemble into a network to share their data for mutual benefit. PDNs are enabled by distribu...
Cyrus Shahabi, Farnoush Banaei Kashani
IANDC
2010
67views more  IANDC 2010»
14 years 8 months ago
Parameterized computational complexity of Dodgson and Young elections
We show that the two NP-complete problems of Dodgson Score and Young Score have differing computational complexities when the winner is close to being a Condorcet winner. On the ...
Nadja Betzler, Jiong Guo, Rolf Niedermeier
78
Voted
ISAAC
2009
Springer
142views Algorithms» more  ISAAC 2009»
15 years 4 months ago
Of Choices, Failures and Asynchrony: The Many Faces of Set Agreement
Abstract. Set agreement is a fundamental problem in distributed computing in which processes collectively choose a small subset of values from a larger set of proposals. The imposs...
Dan Alistarh, Seth Gilbert, Rachid Guerraoui, Core...
GLVLSI
2009
IEEE
159views VLSI» more  GLVLSI 2009»
15 years 5 months ago
On the complexity of graph cuboidal dual problems for 3-D floorplanning of integrated circuit design
This paper discusses the impact of migrating from 2-D to 3-D on floorplanning and placement. By looking at a basic formulation of graph cuboidal dual problem, we show that the 3-...
Renshen Wang, Chung-Kuan Cheng