Sciweavers

958 search results - page 120 / 192
» Efficient data structures for range-aggregate queries on tre...
Sort
View
ISAAC
2009
Springer
132views Algorithms» more  ISAAC 2009»
15 years 4 months ago
Online Sorted Range Reporting
Abstract. We study the following one-dimensional range reporting problem: On an array A of n elements, support queries that given two indices i ≤ j and an integer k report the k ...
Gerth Stølting Brodal, Rolf Fagerberg, Mark...
DEXA
2004
Springer
140views Database» more  DEXA 2004»
15 years 3 months ago
Declustering of Trajectories for Indexing of Moving Objects Databases
Efficient storage and retrieval of trajectory indexes has become an essential requirement for moving objects databases. The existing 3DR-tree is known to be an effective trajectory...
Youngduk Seo, Bonghee Hong
BMCBI
2010
142views more  BMCBI 2010»
14 years 10 months ago
pplacer: linear time maximum-likelihood and Bayesian phylogenetic placement of sequences onto a fixed reference tree
Background: Likelihood-based phylogenetic inference is generally considered to be the most reliable classification method for unknown sequences. However, traditional likelihood-ba...
Frederick A. Matsen III, Robin B. Kodner, E. Virgi...
ICCV
2009
IEEE
16 years 3 months ago
Efficient subset selection based on the Renyi entropy
Many machine learning algorithms require the summation of Gaussian kernel functions, an expensive operation if implemented straightforwardly. Several methods have been proposed t...
Vlad I. Morariu1, Balaji V. Srinivasan, Vikas C. R...
VLDB
2000
ACM
99views Database» more  VLDB 2000»
15 years 1 months ago
Efficient Filtering of XML Documents for Selective Dissemination of Information
Information Dissemination applications are gaining increasing popularity due to dramatic improvements in communications bandwidth and ubiquity. The sheer volume of data available ...
Mehmet Altinel, Michael J. Franklin