Sciweavers

199 search results - page 35 / 40
» Randomised Individual Communication Complexity
Sort
View
ICALP
2005
Springer
14 years 1 months ago
Computational Bounds on Hierarchical Data Processing with Applications to Information Security
Motivated by the study of algorithmic problems in the domain of information security, in this paper, we study the complexity of a new class of computations over a collection of va...
Roberto Tamassia, Nikos Triandopoulos
SPW
2004
Springer
14 years 27 days ago
Privacy Is Linking Permission to Purpose
Abstract Fabio Massacci1 and Nicola Zannone1 Department of Information and Communication Technology University of Trento - Italy {massacci,zannone} at dit.unitn.it The last years h...
Fabio Massacci, Nicola Zannone
CIKM
2008
Springer
13 years 9 months ago
Mining social networks using heat diffusion processes for marketing candidates selection
Social Network Marketing techniques employ pre-existing social networks to increase brands or products awareness through word-of-mouth promotion. Full understanding of social netw...
Hao Ma, Haixuan Yang, Michael R. Lyu, Irwin King
ACSC
2006
IEEE
14 years 1 months ago
Modelling layer 2 and layer 3 device bandwidths using B-node theory
Modern computer networks contain an amalgamation of devices and technologies, with the performance exhibited by each central to digital communications. Varieties of methods exist ...
S. Cikara, Stanislaw P. Maj, David T. Shaw
SIGECOM
2010
ACM
164views ECommerce» more  SIGECOM 2010»
14 years 11 days ago
Truthful mechanisms with implicit payment computation
It is widely believed that computing payments needed to induce truthful bidding is somehow harder than simply computing the allocation. We show that the opposite is true for singl...
Moshe Babaioff, Robert D. Kleinberg, Aleksandrs Sl...