Sciweavers

3017 search results - page 502 / 604
» On compressing social networks
Sort
View
WIAS
2010
102views more  WIAS 2010»
13 years 8 months ago
Information security underlying transparent computing: Impacts, visions and challenges
The rapid development of computer network technologies and social informationalization has brought many new opportunities and challenges in information security. With improved info...
Yaoxue Zhang, Laurence Tianruo Yang, Yuezhi Zhou, ...
IEAAIE
2010
Springer
13 years 8 months ago
Strategies for Incorporating Knowledge Defects and Path Length in Trust Aggregation
The ability for a user to accurately estimate the amount of trust to be placed in a peer user is gaining more and more attention in social network applications. Trust aggregation p...
Nele Verbiest, Chris Cornelis, Patricia Victor, En...
ISAAC
2010
Springer
226views Algorithms» more  ISAAC 2010»
13 years 8 months ago
On Tractable Cases of Target Set Selection
We study the NP-complete TARGET SET SELECTION (TSS) problem occurring in social network analysis. Complementing results on its approximability and extending results for its restric...
André Nichterlein, Rolf Niedermeier, Johann...
TKDE
2012
250views Formal Methods» more  TKDE 2012»
12 years 14 days ago
Dense Subgraph Extraction with Application to Community Detection
— This paper presents a method for identifying a set of dense subgraphs of a given sparse graph. Within the main applications of this “dense subgraph problem”, the dense subg...
Jie Chen 0007, Yousef Saad
CORR
2011
Springer
199views Education» more  CORR 2011»
13 years 1 months ago
Maximum Gain Round Trips with Cost Constraints
Searching for optimal ways in a network is an important task in multiple application areas such as social networks, co-citation graphs or road networks. In the majority of applicat...
Franz Graf, Hans-Peter Kriegel, Matthias Schubert