Sciweavers

4744 search results - page 777 / 949
» Connected Computing
Sort
View

Publication
203views
15 years 6 months ago
Multigraph Sampling of Online Social Networks
State-of-the-art techniques for probability sampling of users of online social networks (OSNs) are based on random walks on a single social relation. While powerful, these methods ...
Minas Gjoka, Carter T. Butts, Maciej Kurant, Athin...
CORR
2010
Springer
130views Education» more  CORR 2010»
15 years 6 months ago
Discrete Partitioning and Coverage Control for Gossiping Robots
We propose distributed algorithms to automatically deploy a group of mobile robots to partition and provide coverage of a non-convex environment. To handle arbitrary nonconvex envi...
Joseph W. Durham, Ruggero Carli, Paolo Frasca, Fra...
ENTCS
2010
127views more  ENTCS 2010»
15 years 6 months ago
Combining Model Reductions
Molecular biological models usually suffer from a large combinatorial explosion. Indeed, proteins form complexes and modify each others, which leads to the formation of a huge num...
Ferdinanda Camporesi, Jérôme Feret, H...
EOR
2010
102views more  EOR 2010»
15 years 6 months ago
The Tree of Hubs Location Problem
The Tree-of-Hubs Location Problem is studied. This problem, which combines several aspects of some location, network design and routing problems, is inspired by those transportati...
Iván A. Contreras, Elena Fernández, ...
AI
2006
Springer
15 years 6 months ago
Controlled generation of hard and easy Bayesian networks: Impact on maximal clique size in tree clustering
This article presents and analyzes algorithms that systematically generate random Bayesian networks of varying difficulty levels, with respect to inference using tree clustering. ...
Ole J. Mengshoel, David C. Wilkins, Dan Roth