3220 search results - page 136 / 644 » Constrained Graph Processes |
TSP
2008
14 years 10 months ago
2008
In multitarget scenarios, kinematic constraints from the interaction of targets with their environment or other targets can restrict target motion. Such motion constraint informati...
FSTTCS
2010
Springer
14 years 8 months ago
2010
Springer
Bisimulation equivalence is decidable in polynomial time over normed graphs generated by a context-free grammar. We present a new algorithm, working in time O(n5 ), thus improving...
JMLR
2010
14 years 4 months ago
2010
An algorithm is presented for topology selection in graphical models of autoregressive Gaussian time series. The graph topology of the model represents the sparsity pattern of the...
ISPW
2008
IEEE
15 years 4 months ago
2008
IEEE
Most process models calibrate their internal settings using historical data. Collecting this data is expensive, tedious, and often an incomplete process. Is it possible to make acc...
DCOSS
2006
Springer
15 years 1 months ago
2006
Springer
We consider in-network processing via local message passing. The considered setting involves a set of sensors each of which can communicate with a subset of other sensors. There is...