1445 search results - page 183 / 289 » XPath query containment |
121
Voted
STOC
2003
ACM
16 years 4 months ago
2003
ACM
Let H be a fixed directed graph on h vertices, let G be a directed graph on n vertices and suppose that at least n2 edges have to be deleted from it to make it H-free. We show tha...
150
Voted
CVPR
2005
IEEE
16 years 5 months ago
2005
IEEE
We present a "parts and structure" model for object category recognition that can be learnt efficiently and in a semisupervised manner: the model is learnt from example ...
141
Voted
ECCV
2008
Springer
16 years 5 months ago
2008
Springer
We propose an approach for detecting objects in large-scale range datasets that combines bottom-up and top-down processes. In the bottom-up stage, fast-to-compute local descriptors...
220
Voted
ICDE
2006
IEEE
16 years 5 months ago
2006
IEEE
We present MiniCount, the first efficient sound and complete algorithm for finding maximally contained rewritings of conjunctive queries with count, using conjunctive views with c...
114
Voted
ICMCS
2006
IEEE
15 years 9 months ago
2006
IEEE
For the RISM A/II collection of musical incipits (short extracts of scores, taken from the beginning), we have established a ground truth based on the opinions of human experts. I...