268 search results - page 17 / 54 » Generalized pattern matching using orbit decomposition |
91
Voted
ICDE
2010
IEEE
15 years 11 months ago
2010
IEEE
A fundamental problem in XML query processing is tree pattern query (TPQ) matching which computes all data instances in an XML database that match an input TPQ. There is a lot of r...
CVPR
2011
IEEE
14 years 3 months ago
2011
IEEE
We describe a simple model for parsing pedestrians based on shape. Our model assembles candidate parts from an oversegmentation of the image and matches them to a library of exemp...
132
click to vote
SIAMJO
2011
14 years 2 months ago
2011
Suppose we are given a matrix that is formed by adding an unknown sparse matrix to an unknown low-rank matrix. Our goal is to decompose the given matrix into its sparse and low-ran...
KDD
2007
ACM
16 years 3 days ago
2007
ACM
Given its importance, the problem of predicting rare classes in large-scale multi-labeled data sets has attracted great attentions in the literature. However, the rare-class probl...
118
click to vote
PETRA
2009
ACM
15 years 6 months ago
2009
ACM
Event search is the problem of identifying events or activity of interest in a large database storing long sequences of activity. In this paper, our topic is the problem of identi...