3218 search results - page 387 / 644 » Timed Extensions for SDL |
206
click to vote
SIGMOD
2010
ACM
15 years 4 months ago
2010
ACM
Given a graph database D and a query graph g, an exact subgraph matching query asks for the set S of graphs in D that contain g as a subgraph. This type of queries find important...
191
click to vote
TVCG
2010
15 years 4 months ago
2010
— This paper presents topology-based methods to robustly extract, analyze, and track features defined as subsets of isosurfaces. First, we demonstrate how features identified b...
205
click to vote
CVPR
2009
IEEE
17 years 1 months ago
2009
IEEE
In this paper, we study the problem of nonnegative graph
embedding, originally investigated in [14] for reaping the
benefits from both nonnegative data factorization and the
spe...
166
click to vote
ICCV
2009
IEEE
16 years 11 months ago
2009
IEEE
Correspondence problems are of great importance in
computer vision. They appear as subtasks in many applications
such as object recognition, merging partial 3D reconstructions
a...
159
click to vote
CVPR
2004
IEEE
16 years 8 months ago
2004
IEEE
Semantic scene classification based only on low-level vision cues has had limited success on unconstrained image sets. On the other hand, camera metadata related to capture condit...