806 search results - page 56 / 162 » An Optimal Dynamic Data Structure for Stabbing-Semigroup Que... |
FGCS
2007
13 years 9 months ago
2007
This paper describes a major restructuring of PROuST, a method for protein structure comparison, for an efficient porting to the Grid. PROuST consists of different components: an...
SODA
2008
ACM
13 years 10 months ago
2008
ACM
Sleator and Tarjan [39] conjectured that splay trees are dynamically optimal binary search trees (BST). In this context, we study the skip list data structure introduced by Pugh [...
COMPGEOM
2010
ACM
14 years 2 months ago
2010
ACM
We revisit one of the most fundamental classes of data structure problems in computational geometry: range searching. Back in SoCG’92, Matouˇsek gave a partition tree method fo...
KDD
2008
ACM
14 years 9 months ago
2008
ACM
Learning to rank from relevance judgment is an active research area. Itemwise score regression, pairwise preference satisfaction, and listwise structured learning are the major te...
ICDE
2008
IEEE
14 years 10 months ago
2008
IEEE
Aggregate measures summarizing subsets of data are valuable in exploratory analysis and decision support, especially when dependent aggregations can be easily specified and compute...