58 search results - page 7 / 12 » Graph Invariants as Necessary Conditions for Global Constrai... |
DIALM
2005
ACM
13 years 9 months ago
2005
ACM
We investigate to what extent flooding and routing is possible if the graph is allowed to change unpredictably at each time step. We study what minimal requirements are necessary...
ECCV
2006
Springer
14 years 9 months ago
2006
Springer
We present a dynamic near-regular texture (NRT) tracking algorithm nested in a lattice-based Markov-Random-Field (MRF) model of a 3D spatiotemporal space. One basic observation use...
ICTAI
2003
IEEE
2003
IEEE
Partitioning of Temporal Planning Problems in Mixed Space Using the Theory of Extended Saddle Points
14 years 26 days ago
We study the partitioning of temporal planning problems formulated as mixed-integer nonlinear programming problems, develop methods to reduce the search space of partitioned subpr...
CVPR
2009
IEEE
15 years 2 months ago
2009
IEEE
Global shape information is an effective top-down complement
to bottom-up figure-ground segmentation as well
as a useful constraint to avoid drift during adaptive tracking.
We p...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
—In a sensor network, in practice, the communication among sensors is subject to: 1) errors that can cause failures of links among sensors at random times; 2) costs; and 3) const...