Sciweavers

440 search results - page 60 / 88
» Decision making in very large networks
Sort
View
KDD
2010
ACM
215views Data Mining» more  KDD 2010»
14 years 17 days ago
On the quality of inferring interests from social neighbors
This paper intends to provide some insights of a scientific problem: how likely one’s interests can be inferred from his/her social connections – friends, friends’ friends,...
Zhen Wen, Ching-Yung Lin
KDD
2002
ACM
127views Data Mining» more  KDD 2002»
14 years 9 months ago
Mining knowledge-sharing sites for viral marketing
Viral marketing takes advantage of networks of influence among customers to inexpensively achieve large changes in behavior. Our research seeks to put it on a firmer footing by mi...
Matthew Richardson, Pedro Domingos
CCR
2002
62views more  CCR 2002»
13 years 8 months ago
An enforced inter-admission delay performance-driven connection admission control algorithm
Connection Admission Control (CAC) is an important function in a computer network that supports Quality of Service (QoS). The function of CAC is to decide whether a new connection...
Stanislav Belenki
NIPS
1998
13 years 10 months ago
Approximate Learning of Dynamic Models
Inference is a key component in learning probabilistic models from partially observable data. When learning temporal models, each of the many inference phases requires a complete ...
Xavier Boyen, Daphne Koller
IAT
2009
IEEE
14 years 3 months ago
Introducing Communication in Dis-POMDPs with Finite State Machines
Distributed Partially Observable Markov Decision Problems (DisPOMDPs) are emerging as a popular approach for modeling sequential decision making in teams operating under uncertain...
Yuki Iwanari, Makoto Tasaki, Makoto Yokoo, Atsushi...