Sciweavers

176 search results - page 12 / 36
» Network Probabilistic Connectivity: Optimal Structures
Sort
View
SDM
2008
SIAM
138views Data Mining» more  SDM 2008»
13 years 9 months ago
Learning Markov Network Structure using Few Independence Tests
In this paper we present the Dynamic Grow-Shrink Inference-based Markov network learning algorithm (abbreviated DGSIMN), which improves on GSIMN, the state-ofthe-art algorithm for...
Parichey Gandhi, Facundo Bromberg, Dimitris Margar...
IPCCC
2007
IEEE
14 years 1 months ago
Optimal Cluster Head Selection in the LEACH Architecture
LEACH (Low Energy Adaptive Clustering Hierarchy) [1] is one of the popular cluster-based structures, which has been widely proposed in wireless sensor networks. LEACH uses a TDMA ...
Haiming Yang, Biplab Sikdar
CORR
2010
Springer
134views Education» more  CORR 2010»
13 years 7 months ago
Incremental Sampling-based Algorithms for Optimal Motion Planning
During the last decade, incremental sampling-based motion planning algorithms, such as the Rapidly-exploring Random Trees (RRTs), have been shown to work well in practice and to po...
Sertac Karaman, Emilio Frazzoli
SIGGRAPH
1993
ACM
13 years 11 months ago
Sensor-actuator networks
Sensor-actuator networks (SANs) are a new approach for the physically-based animation of objects. The user supplies the configuratíon of a mechanical system that hás been augmen...
Michiel van de Panne
IJCNN
2007
IEEE
14 years 1 months ago
Predicting Spike Activity in Neuronal Cultures
be regarded as an abstraction of the underlying effective network connectivity, i.e. its functional connectivity. Although similar functional connectivity models have been describe...
Tayfun Gürel, Ulrich Egert, Steffen Kandler, ...