1161 search results - page 29 / 233 » Kinetic Dependence Graphs |
130
Voted
CISS
2007
IEEE
15 years 4 months ago
2007
IEEE
The problem of routing of sensor observations for optimal detection of a Markov random field (MRF) at a designated fusion center is analyzed. Assuming that the correlation structur...
89
Voted
DCOSS
2005
Springer
15 years 6 months ago
2005
Springer
We present an efficient distributed data structure, called the D-SPANNER, for maintaining proximity information among communicating mobile nodes. The D-SPANNER is a kinetic sparse...
114
click to vote
DEXA
2010
Springer
15 years 19 days ago
2010
Springer
Given a spatio-temporal network (ST network) whose edge properties vary with time, a time-sub-interval minimum spanning tree (TSMST) is a collection of distinct minimum spanning t...
141
click to vote
WG
2010
Springer
14 years 10 months ago
2010
Springer
Θk-graphs are geometric graphs that appear in the context of graph navigation. The shortest-path metric of these graphs is known to approximate the Euclidean complete graph up to...
ACL
2003
15 years 1 months ago
2003
This paper presents a dependency language model (DLM) that captures linguistic constraints via a dependency structure, i.e., a set of probabilistic dependencies that express the r...