415 search results - page 51 / 83 » Optimal query complexity bounds for finding graphs |
122
click to vote
PODS
2006
ACM
16 years 3 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...
207
Voted
IGIS
1994
15 years 7 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...
206
Voted
ICDE
2007
IEEE
16 years 4 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...
136
click to vote
DGCI
2009
Springer
15 years 6 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...
142
click to vote
CORR
2010
Springer
15 years 3 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...