813 search results - page 69 / 163 » Efficient Processing of Updates in Dynamic XML Data |
VLDB
2007
ACM
14 years 9 months ago
2007
ACM
Given a multidimensional point q, a reverse k nearest neighbor (RkNN) query retrieves all the data points that have q as one of their k nearest neighbors. Existing methods for proc...
BMCBI
2006
13 years 9 months ago
2006
Background: Many proteomics initiatives require integration of all information with uniformcriteria from collection of samples and data display to publication of experimental resu...
SIGMOD
2008
ACM
13 years 9 months ago
2008
ACM
Tree pattern queries (TPQs) provide a natural and easy formalism to query tree-structured XML data, and the efficient processing of such queries has attracted a lot of attention. ...
ICPR
2006
IEEE
14 years 10 months ago
2006
IEEE
Dynamic Time Warping (DTW) has been widely used to align and compare two sequences. DTW can efficiently deal with local warp or deformation between sequences. However, it can'...
MCS
2008
Springer
13 years 8 months ago
2008
Springer
Dynamical low-rank approximation is a differential-equation based approach to efficiently computing low-rank approximations to time-dependent large data matrices or to solutions o...