1688 search results - page 75 / 338 » The Complexity of Rationalizing Matchings |
CVPR
2011
IEEE
13 years 1 months ago
2011
IEEE
3D Shape matching is an important problem in computer vision. One of the major difficulties in finding dense correspondences between 3D shapes is related to the topological disc...
WWW
2009
ACM
14 years 10 months ago
2009
ACM
Ad auctions in sponsored search support"broad match"that allows an advertiser to target a large number of queries while bidding only on a limited number. While giving mo...
FGR
2008
IEEE
14 years 4 months ago
2008
IEEE
In recent years, 3D face recognition has obtained much attention. Using 2D face image as probe and 3D face data as gallery is an alternative method to deal with computation comple...
INFOCOM
2011
IEEE
13 years 1 months ago
2011
IEEE
Abstract—Regular expression matching (REM) with nondeterministic finite automata (NFA) can be computationally expensive when a large number of patterns are matched concurrently....
DASFAA
2007
IEEE
14 years 4 months ago
2007
IEEE
Twig pattern matching problem has been widely studied in recent years. Give an XML tree T . A twig-pattern matching query, Q, represented as a query tree, is to find all the occur...