1830 search results - page 135 / 366 » Workshop on Graph Computation Models |
126
click to vote
ICPR
2006
IEEE
16 years 5 months ago
2006
IEEE
We present a unified framework for modeling and solving invariant point pattern matching problems. Invariant features are encoded as potentials in a probabilistic graphical model....
156
Voted
AI
2002
Springer
15 years 4 months ago
2002
Springer
Bayesian networks, equivalently graphical Markov models determined by acyclic digraphs or ADGs (also called directed acyclic graphs or dags), have proved to be both effective and ...
163
click to vote
TCSV
2002
15 years 4 months ago
2002
Video query by semantic keywords is one of the most challenging research issues in video data management. To go beyond low-level similarity and access video data content by semanti...
149
click to vote
ECML
2004
Springer
15 years 10 months ago
2004
Springer
This work presents a novel procedure for computing (1) distances between nodes of a weighted, undirected, graph, called the Euclidean Commute Time Distance (ECTD), and (2) a subspa...
134
Voted
ESA
1998
Springer
15 years 8 months ago
1998
Springer
We present a new approach for designing external graph algorithms and use it to design simple, deterministic and randomized external algorithms for computing connected components, ...