Sciweavers

972 search results - page 5 / 195
» Performance of data networks with random links
Sort
View
ICDM
2006
IEEE
93views Data Mining» more  ICDM 2006»
15 years 5 months ago
Comparisons of K-Anonymization and Randomization Schemes under Linking Attacks
Recently K-anonymity has gained popularity as a privacy quantification against linking attacks, in which attackers try to identify a record with values of some identifying attrib...
Zhouxuan Teng, Wenliang Du
NIPS
2007
15 years 1 months ago
Gaussian Process Models for Link Analysis and Transfer Learning
In this paper we model relational random variables on the edges of a network using Gaussian processes (GPs). We describe appropriate GP priors, i.e., covariance functions, for dir...
Kai Yu, Wei Chu
ICC
2007
IEEE
15 years 6 months ago
Energy and Utility Optimization in Wireless Networks with Random Access
— Energy consumption is a main issue of concern in wireless networks. Energy minimization increases the time that networks’ nodes work properly without recharging or substituti...
Amir Mahdi Khodaian, Babak Hossein Khalaj
AIRWEB
2007
Springer
15 years 5 months ago
Extracting Link Spam using Biased Random Walks from Spam Seed Sets
Link spam deliberately manipulates hyperlinks between web pages in order to unduly boost the search engine ranking of one or more target pages. Link based ranking algorithms such ...
Baoning Wu, Kumar Chellapilla
JSAC
2007
83views more  JSAC 2007»
14 years 11 months ago
Constructing an optimal server set in structured peer-to-peer networks
— To achieve high performance and resilience to failures, a client can make connections with multiple servers simultaneously and receive different portions of the data from each ...
Seung Chul Han, Ye Xia