275 search results - page 37 / 55 » A compact data structure for representing a dynamic multiset |
SDM
2009
SIAM
14 years 5 months ago
2009
SIAM
Most pattern discovery algorithms easily generate very large numbers of patterns, making the results impossible to understand and hard to use. Recently, the problem of instead sel...
CVPR
2007
IEEE
14 years 10 months ago
2007
IEEE
We describe a probabilistic framework for recognizing human activities in monocular video based on simple silhouette observations in this paper. The methodology combines kernel pr...
SAS
2004
Springer
14 years 2 months ago
2004
Springer
We describe data structures and algorithms for performing a path-sensitive program analysis to discover equivalences of expressions involving linear arithmetic or uninterpreted fun...
EDBT
1992
ACM
14 years 5 days ago
1992
ACM
The DBGraph storage model, designed for main memory DBMS, ensures both data storage compactness and efficient processing for all database operations. By representing the entire da...
PR
2008
13 years 8 months ago
2008
We present a unified feature representation of 2.5D pointclouds and apply it to face recognition. The representation integrates local and global geometrical cues in a single compa...