1172 search results - page 159 / 235 » Path Algorithms on Regular Graphs |
153
click to vote
TIT
2010
15 years 23 days ago
2010
Abstract--Glass models are frequently used to model gene regulatory networks. A distinct feature of the Glass model is that its dynamics can be formalized as paths through multi-di...
160
click to vote
FOCS
1999
IEEE
15 years 10 months ago
1999
IEEE
We consider the DIRECTED STEINER NETWORK problem, also called the POINT-TO-POINT CONNECTION problem, where given a directed graph G and p pairs {(s1,t1),...,(sp,tp)} of nodes in t...
179
click to vote
HYBRID
2001
Springer
15 years 10 months ago
2001
Springer
Efficient algorithms exist for fault detection and isolation of physical systems based on functional redundancy. In a qualitative approach, this redundancy can be captured by a tem...
150
click to vote
CORR
2011
Springer
14 years 9 months ago
2011
Springer
Many applications, including provenance and some analyses of social networks, require path-based queries over graphstructured data. When these graphs contain sensitive information...
166
click to vote
CVPR
2003
IEEE
16 years 8 months ago
2003
IEEE
In many applications of graphical models arising in computer vision, the hidden variables of interest are most naturally specified by continuous, non-Gaussian distributions. There...