242 search results - page 34 / 49 » An Efficient Method for Indexing Now-relative Bitemporal dat... |
LCPC
2000
Springer
13 years 11 months ago
2000
Springer
In translating HPF programs, a compiler has to generate local iteration and communication sets. Apart from local enumeration, local storage compression is an issue, because in HPF ...
ICDE
2002
IEEE
14 years 9 months ago
2002
IEEE
Overlapping and multi-version techniques are two popular frameworks that transform an ephemeral index into a multiple logical-tree structure in order to support versioning databas...
KDD
2004
ACM
14 years 8 months ago
2004
ACM
Mining frequent structural patterns from graph databases is an interesting problem with broad applications. Most of the previous studies focus on pruning unfruitful search subspac...
ICCV
2009
IEEE
13 years 5 months ago
2009
IEEE
Action recognition methods suffer from many drawbacks in practice, which include (1)the inability to cope with incremental recognition problems; (2)the requirement of an intensive...
BTW
2007
Springer
13 years 11 months ago
2007
Springer
: The reverse k-nearest neighbor (RkNN) problem, i.e. finding all objects in a data set the k-nearest neighbors of which include a specified query object, has received increasing a...