Sciweavers

4781 search results - page 235 / 957
» Online algorithms for network design
Sort
View
KDD
2009
ACM
190views Data Mining» more  KDD 2009»
16 years 7 months ago
Efficient influence maximization in social networks
Influence maximization is the problem of finding a small subset of nodes (seed nodes) in a social network that could maximize the spread of influence. In this paper, we study the ...
Wei Chen, Yajun Wang, Siyu Yang
JMLR
2008
159views more  JMLR 2008»
15 years 6 months ago
Near-Optimal Sensor Placements in Gaussian Processes: Theory, Efficient Algorithms and Empirical Studies
When monitoring spatial phenomena, which can often be modeled as Gaussian processes (GPs), choosing sensor locations is a fundamental task. There are several common strategies to ...
Andreas Krause, Ajit Paul Singh, Carlos Guestrin
FORTE
1998
15 years 8 months ago
Fault-oriented Test Generation for Multicast Routing Protocol Design
Abstract: We present a new algorithm for automatic test generation for multicast routing. Our algorithm processes a nite state machine (FSM) model of the protocol and uses a mix of...
Ahmed Helmy, Deborah Estrin, Sandeep K. S. Gupta
PERCOM
2006
ACM
16 years 6 months ago
Analysing fundamental properties of marker-based vision system designs
This paper investigates fundamental properties of Marker-based Vision (MBV) systems. We present a theoretical analysis of the performance of basic tag designs which is extended th...
Andrew C. Rice, Robert K. Harle, Alastair R. Beres...
PERCOM
2006
ACM
16 years 6 months ago
Cantag: an open source software toolkit for designing and deploying marker-based vision systems
This paper presents Cantag, an open source software toolkit for building Marker-based Vision (MBV) systems that can identify and accurately locate printed markers in three dimensi...
Andrew C. Rice, Alastair R. Beresford, Robert K. H...