1830 search results - page 265 / 366 » Workshop on Graph Computation Models |
161
click to vote
CSR
2006
Springer
15 years 8 months ago
2006
Springer
We propose a new model of restricted branching programs specific to solving GEN problems, which we call incremental branching programs. We show that syntactic incremental branchin...
161
click to vote
CVPR
2009
IEEE
17 years 2 days ago
2009
IEEE
We propose a space-time Markov Random Field (MRF)
model to detect abnormal activities in video. The nodes in
the MRF graph correspond to a grid of local regions in the
video fra...
183
click to vote
PRDC
2009
IEEE
15 years 11 months ago
2009
IEEE
—With ever-growing complexity of computer and communication systems analytical methods do not scale, especially with respect to dependability assessment of information technology...
172
click to vote
ACL
2009
15 years 2 months ago
2009
Dependency parsers show syntactic relations between words using a directed graph, but comparing dependency parsers is difficult because of differences in theoretical models. We de...
133
click to vote
WIAMIS
2009
IEEE
15 years 11 months ago
2009
IEEE
In this paper, we consider the challenging problem of object duplicate detection and localization. Several applications require efficient object duplicate detection methods, such ...