Sciweavers

1933 search results - page 169 / 387
» Query Containment Using Views
Sort
View
135
Voted
PVLDB
2008
108views more  PVLDB 2008»
15 years 2 months ago
Taming verification hardness: an efficient algorithm for testing subgraph isomorphism
Graphs are widely used to model complicated data semantics in many applications. In this paper, we aim to develop efficient techniques to retrieve graphs, containing a given query...
Haichuan Shang, Ying Zhang, Xuemin Lin, Jeffrey Xu...
WADS
2009
Springer
291views Algorithms» more  WADS 2009»
15 years 10 months ago
On the Power of the Semi-Separated Pair Decomposition
Abstract. A Semi-Separated Pair Decomposition (SSPD), with parameter s > 1, of a set S ⊂ Rd is a set {(Ai, Bi)} of pairs of subsets of S such that for each i, there are balls ...
Mohammad Ali Abam, Paz Carmi, Mohammad Farshi, Mic...
158
Voted
PETRA
2009
ACM
15 years 10 months ago
Towards faster activity search using embedding-based subsequence matching
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...
Panagiotis Papapetrou, Paul Doliotis, Vassilis Ath...
136
Voted
ADAEUROPE
2003
Springer
15 years 8 months ago
Charles: A Data Structure Library for Ada95
ontainer. In particular, an iterator abstracts away differences in specific container types, allowing you to view the collection simply as a sequence of items. A generic algorith...
Matthew Heaney
CVPR
2009
IEEE
16 years 10 months ago
Visibility Constraints on Features of 3D Objects
To recognize three-dimensional objects it is important to model how their appearances can change due to changes in viewpoint. A key aspect of this involves understanding which o...
Ronen Basri, Pedro F. Felzenszwalb, Ross B. Girshi...