814 search results - page 70 / 163 » Optimal pairings |
CVPR
2005
IEEE
15 years 6 hour ago
2005
IEEE
Standard but ad hoc measures such as sum-of-squared pixel differences (SSD) are often used when comparing and registering two images that have not been previously observed before....
IPL
2008
13 years 10 months ago
2008
A path partition of a graph G is a set of vertex-disjoint paths that cover all vertices of G. Given a set P = {{ai, bi}}m i=1 of pairs of distinct vertices of the n-dimensional hy...
EJC
2007
13 years 10 months ago
2007
We introduce and study online balanced coloring games on the random graph process. The game is played by a player we call Painter. Edges of the complete graph with n vertices are ...
CVPR
2003
IEEE
15 years 6 hour ago
2003
IEEE
In this paper, we present a new multimodal image registration method based on the a priori knowledge of the class label mappings between two segmented input images. A joint class ...
JACM
2006
13 years 10 months ago
2006
In this article, we study the problem of online market clearing where there is one commodity in the market being bought and sold by multiple buyers and sellers whose bids arrive an...