2754 search results - page 451 / 551 » Distributed Weighted Matching |
161
click to vote
SIGMOD
2010
ACM
15 years 2 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...
135
Voted
MOBIHOC
2012
ACM
13 years 6 months ago
2012
ACM
Nowadays, an increasing number of objects can be represented by their wireless electronic identifiers. For example, people can be recognized by their phone numbers or their phone...
302
click to vote
ICFP
2012
ACM
13 years 6 months ago
2012
ACM
Graphics processing units (GPUs) provide both memory bandwidth and arithmetic performance far greater than that available on CPUs but, because of their Single-Instruction-Multiple...
176
click to vote
CVPR
2009
IEEE
16 years 11 months ago
2009
IEEE
Establishing visual correspondences is an essential component
of many computer vision problems, and is often done
with robust, local feature-descriptors. Transmission and
storag...
161
Voted
CVPR
2009
IEEE
16 years 10 months ago
2009
IEEE
We describe a novel and robust feature descriptor called ordinal spatial intensity distribution (OSID) which is invariant to any monotonically increasing brightness changes. Many t...