Sciweavers

3265 search results - page 330 / 653
» Representing Groups on Graphs
Sort
View
DCOSS
2008
Springer
15 years 8 months ago
On the Deterministic Tracking of Moving Objects with a Binary Sensor Network
This paper studies the problem of associating deterministically a track revealed by a binary sensor network with the trajectory of a unique moving anonymous object, namely the Mult...
Yann Busnel, Leonardo Querzoni, Roberto Baldoni, M...
UAI
2008
15 years 8 months ago
Discovering Cyclic Causal Models by Independent Components Analysis
We generalize Shimizu et al's (2006) ICA-based approach for discovering linear non-Gaussian acyclic (LiNGAM) Structural Equation Models (SEMs) from causally sufficient, conti...
Gustavo Lacerda, Peter Spirtes, Joseph Ramsey, Pat...
AI
2002
Springer
15 years 6 months ago
The size distribution for Markov equivalence classes of acyclic digraph models
Bayesian networks, equivalently graphical Markov models determined by acyclic digraphs or ADGs (also called directed acyclic graphs or dags), have proved to be both effective and ...
Steven B. Gillispie, Michael D. Perlman
TCOM
2010
109views more  TCOM 2010»
15 years 5 months ago
Results on Finite Wireless Networks on a Line
Abstract— Today, due to the vast amount of literature on largescale wireless networks, we have a fair understanding of the asymptotic behavior of such networks. However, in real ...
Ali Eslami, Mohammad Nekoui, Hossein Pishro-Nik
EMSOFT
2011
Springer
14 years 6 months ago
Hard-real-time scheduling of data-dependent tasks in embedded streaming applications
Most of the hard-real-time scheduling theory for multiprocessor systems assumes independent periodic or sporadic tasks. Such a simple task model is not directly applicable to mode...
Mohamed Bamakhrama, Todor Stefanov