2127 search results - page 232 / 426 » Computing large matchings fast |
197
click to vote
IAT
2006
IEEE
16 years 1 months ago
2006
IEEE
Combinatorial Auctions (CAs), where users bid on combination of items, have emerged as a useful tool for resource allocation in distributed systems. However, two main difficulties...
207
click to vote
TIP
2002
15 years 6 months ago
2002
A conventional color histogram (CCH) considers neither the color similarity across different bins nor the color dissimilarity in the same bin. Therefore, it is sensitive to noisy i...
236
click to vote
MM
2009
ACM
15 years 12 months ago
2009
ACM
Following the exponential growth of social media, there now exist huge repositories of videos online. Among the huge volumes of videos, there exist large numbers of near-duplicate...
221
click to vote
TIP
1998
15 years 6 months ago
1998
Abstract—In this paper, we propose an optimal quadtree (QT)based motion estimator for video compression. It is optimal in the sense that for a given bit budget for encoding the d...
202
click to vote
TON
2010
15 years 1 months ago
2010
Abstract--A novel storage design for IP routing table construction is introduced on the basis of a single set-associative hash table to support fast longest prefix matching (LPM). ...