415 search results - page 51 / 83 » Optimal query complexity bounds for finding graphs |
PODS
2006
ACM
14 years 7 months ago
2006
ACM
Query containment is a fundamental algorithmic problem in database query processing and optimization. Under set semantics, the query-containment problem for conjunctive queries ha...
IGIS
1994
13 years 11 months ago
1994
During the last decade various spatial data structures have been designed and compared against each other, all of them re ecting a dynamic situation with ongoing object insertion a...
ICDE
2007
IEEE
14 years 9 months ago
2007
IEEE
To retrieve similar database videos to a query clip, each video is typically represented by a sequence of highdimensional feature vectors. Given a query video containing m feature...
DGCI
2009
Springer
13 years 11 months ago
2009
Springer
Finding an efficient optimal partial tiling algorithm is still an open problem. We have worked on a special case, the tiling of Manhattan polyominoes with dominoes, for which we gi...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
This paper presents a new face identification system based on Graph Matching Technique on SIFT features extracted from face images. Although SIFT features have been successfully us...