Sciweavers

1489 search results - page 202 / 298
» Monotonicity in Bayesian Networks
Sort
View
CN
2006
79views more  CN 2006»
15 years 4 months ago
Understanding when location-hiding using overlay networks is feasible
Overlay networks (proxy networks) have been used as a communication infrastructure to allow applications to communicate with users without revealing their IP addresses. Such proxy...
Ju Wang, Andrew A. Chien
VLDB
2001
ACM
139views Database» more  VLDB 2001»
15 years 9 months ago
NetCube: A Scalable Tool for Fast Data Mining and Compression
We propose an novel method of computing and storing DataCubes. Our idea is to use Bayesian Networks, which can generate approximate counts for any query combination of attribute v...
Dimitris Margaritis, Christos Faloutsos, Sebastian...
ORL
1998
68views more  ORL 1998»
15 years 4 months ago
A fast bipartite network flow algorithm for selective assembly
Bipartite network flow problems naturally arise in applications such as selective assembly and preemptive scheduling. This paper presents fast algorithms for these problems that ...
Satoru Iwata, Tomomi Matsui, S. Thomas McCormick
WSDM
2012
ACM
254views Data Mining» more  WSDM 2012»
14 years 5 hour ago
Maximizing product adoption in social networks
One of the key objectives of viral marketing is to identify a small set of users in a social network, who when convinced to adopt a product will influence others in the network l...
Smriti Bhagat, Amit Goyal 0002, Laks V. S. Lakshma...
SIGECOM
2009
ACM
137views ECommerce» more  SIGECOM 2009»
15 years 11 months ago
An exact almost optimal algorithm for target set selection in social networks
The Target Set Selection problem proposed by Kempe, Kleinberg, and Tardos, gives a nice clean combinatorial formulation for many problems arising in economy, sociology, and medicin...
Oren Ben-Zwi, Danny Hermelin, Daniel Lokshtanov, I...