958 search results - page 48 / 192 » Efficient data structures for range-aggregate queries on tre... |
107
click to vote
SODA
2012
ACM
13 years 2 months ago
2012
ACM
We consider the problem of recovering items matching a partially specified pattern in multidimensional trees (quad trees and k-d trees). We assume the traditional model where the...
90
Voted
CIDM
2007
IEEE
15 years 4 months ago
2007
IEEE
Kernel methods are effective approaches to the modeling of structured objects in learning algorithms. Their major drawback is the typically high computational complexity of kernel ...
GECCO
2006
Springer
15 years 4 months ago
2006
Springer
Given the prominence of elite archiving in contemporary multiobjective optimisation research and the limitations inherent in bounded population sizes, it is unusual that the vast ...
108
click to vote
SSD
2001
Springer
15 years 5 months ago
2001
Springer
Intervals represent a fundamental data type for temporal, scientific, and spatial databases where time stamps and point data are extended to time spans and range data, respectively...
79
Voted
MMM
2007
Springer
15 years 6 months ago
2007
Springer
Content-based retrieval of 3D human motion capture data has significant impact in different fields such as physical medicine, rehabilitation, and animation. This paper develops ...