Sciweavers

390 search results - page 73 / 78
» When is an estimation of distribution algorithm better than ...
Sort
View
ATAL
2008
Springer
13 years 9 months ago
Complexity of terminating preference elicitation
Complexity theory is a useful tool to study computational issues surrounding the elicitation of preferences, as well as the strategic manipulation of elections aggregating togethe...
Toby Walsh
WWW
2009
ACM
14 years 8 months ago
Collaborative filtering for orkut communities: discovery of user latent behavior
Users of social networking services can connect with each other by forming communities for online interaction. Yet as the number of communities hosted by such websites grows over ...
WenYen Chen, Jon-Chyuan Chu, Junyi Luan, Hongjie B...
ICDCS
2011
IEEE
12 years 7 months ago
Delay-Cognizant Reliable Delivery for Publish/Subscribe Overlay Networks
—The number of real-world applications that require QoS guarantees is constantly increasing and they often follow the publish/subscribe (pub/sub) messaging paradigm, which provid...
Shuo Guo, Kyriakos Karenos, Minkyong Kim, Hui Lei,...
KDD
2009
ACM
229views Data Mining» more  KDD 2009»
14 years 8 months ago
Relational learning via latent social dimensions
Social media such as blogs, Facebook, Flickr, etc., presents data in a network format rather than classical IID distribution. To address the interdependency among data instances, ...
Lei Tang, Huan Liu
ICDCS
2009
IEEE
14 years 4 months ago
On the Utility of Inference Mechanisms
A number of network path delay, loss, or bandwidth inference mechanisms have been proposed over the past decade. Concurrently, several network measurement services have been deplo...
Ethan Blanton, Sonia Fahmy, Greg N. Frederickson