2754 search results - page 127 / 551 » Distributed Weighted Matching |
109
Voted
CVPR
2010
IEEE
15 years 27 days ago
2010
IEEE
We study the object localization problem in images given a single hand-drawn example or a gallery of shapes as the object model. Although many shape matching algorithms have been ...
111
click to vote
CORR
2012
Springer
13 years 8 months ago
2012
Springer
Graph pattern matching is often defined in terms of subgraph isomorphism, an np-complete problem. To lower its complexity, various extensions of graph simulation have been consid...
93
Voted
STOC
2010
ACM
15 years 10 months ago
2010
ACM
We consider the problem of maintaining a large matching or a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge ins...
103
Voted
ASPDAC
2007
ACM
15 years 4 months ago
2007
ACM
With aggressive scaling down of feature sizes in VLSI fabrication, process variation has become a critical issue in designs. We show that two necessary conditions for the "Ma...
93
Voted
ICPR
2006
IEEE
16 years 1 months ago
2006
IEEE
A non-parametric (NP) sampling method is introduced for obtaining the joint distribution of a pair of images. This method is called NP windowing and is equivalent to sampling the ...