2593 search results - page 347 / 519 » Algorithms and Data Structures for Computer Topology |
DAGSTUHL
2004
13 years 11 months ago
2004
We present the Priority R-tree, or PR-tree, which is the first R-tree variant that always answers a window query using O((N/B)1-1/d + T/B) I/Os, where N is the number of ddimensio...
CIKM
2010
Springer
13 years 8 months ago
2010
Springer
On-Line Analytical Processing (OLAP) has shown great success in many industry applications, including sales, marketing, management, financial data analysis, etc. In this paper, w...
CVPR
2005
IEEE
15 years 7 days ago
2005
IEEE
We propose an approximate Bayesian approach for unsupervised feature selection and density estimation, where the importance of the features for clustering is used as the measure f...
DCC
2005
IEEE
14 years 9 months ago
2005
IEEE
This paper addresses the problem of bit allocation among frames in a predictively encoded video sequence. Finding optimal solutions to this problem potentially requires making an ...
WEBDB
2009
Springer
14 years 4 months ago
2009
Springer
We study the problem of automatically discovering semantic associations between schema elements, namely foreign keys. This problem is important in all applications where data sets...