Sciweavers

1068 search results - page 160 / 214
» Extremely randomized trees
Sort
View
IPSN
2010
Springer
14 years 4 months ago
Routing without routes: the backpressure collection protocol
Current data collection protocols for wireless sensor networks are mostly based on quasi-static minimum-cost routing trees. We consider an alternative, highly-agile approach calle...
Scott Moeller, Avinash Sridharan, Bhaskar Krishnam...
SIGECOM
2009
ACM
137views ECommerce» more  SIGECOM 2009»
14 years 4 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...
RTCSA
1999
IEEE
14 years 2 months ago
A Symbolic Model Checker for Testing ASTRAL Real-Time Specifications
ASTRAL is a high-level formal specification language for real-time (infinite state) systems. It is provided with structuring mechanisms that allow one to build modularized specifi...
Zhe Dang, Richard A. Kemmerer
AI
2011
Springer
13 years 5 months ago
Bounded approximate decentralised coordination via the max-sum algorithm
In this paper we propose a novel approach to decentralised coordination, that is able to efficiently compute solutions with a guaranteed approximation ratio. Our approach is base...
Alex Rogers, Alessandro Farinelli, Ruben Stranders...
ECCV
2008
Springer
14 years 12 months ago
Surface Visibility Probabilities in 3D Cluttered Scenes
Many methods for 3D reconstruction in computer vision rely on probability models, for example, Bayesian reasoning. Here we introduce a probability model of surface visibilities in ...
Michael S. Langer