237 search results - page 29 / 48 » Methods for Achieving Fast Query Times in Point Location Dat... |
EDBT
2006
ACM
13 years 11 months ago
2006
ACM
Utilizing spatial index structures on secondary memory for nearest neighbor search in high-dimensional data spaces has been the subject of much research. With the potential to host...
SIGMOD
2008
ACM
14 years 8 months ago
2008
ACM
The problem of simultaneously clustering columns and rows (coclustering) arises in important applications, such as text data mining, microarray analysis, and recommendation system...
EDBT
2008
ACM
14 years 8 months ago
2008
ACM
Due to the well-known dimensionality curse problem, search in a high-dimensional space is considered as a "hard" problem. In this paper, a novel symmetrical encoding-bas...
TNN
2011
13 years 2 months ago
2011
—Prediction intervals (PIs) have been proposed in the literature to provide more information by quantifying the level of uncertainty associated to the point forecasts. Traditiona...
CIKM
2009
Springer
14 years 16 days ago
2009
Springer
In dynamic environments with frequent content updates, we require online full-text search that scales to large data collections and achieves low search latency. Several recent met...