284 search results - page 50 / 57 » Attributed Graph Matching Using Local Descriptions |
125
click to vote
ICALP
2001
Springer
15 years 2 months ago
2001
Springer
We present a probabilistic algorithm that, given a connected graph G (represented by adjacency lists) of average degree d, with edge weights in the set {1, . . . , w}, and given a ...
CGF
2010
14 years 9 months ago
2010
Spatiotemporal data pose serious challenges to analysts in geographic and other domains. Owing to the complexity of the geospatial and temporal components, this kind of data canno...
ISBI
2002
IEEE
15 years 10 months ago
2002
IEEE
Biomedical imaging of large patient populations, both cross-sectionally and longitudinally, is becoming a standard technique for noninvasive, in-vivo studies of the pathophysiolog...
97
Voted
WOB
2004
14 years 11 months ago
2004
ABSTRACT. Reconfigurable systolic arrays can be adapted to efficiently resolve a wide spectrum of computational problems; parallelism is naturally explored in systolic arrays and r...
94
Voted
ICIAP
2007
ACM
15 years 9 months ago
2007
ACM
In this paper we explore the interlink between temporally dense view-based object recognition and sparse image representations with local keypoints. The temporal component is an a...