921 search results - page 124 / 185 » New Data Structures for Orthogonal Range Searching |
231
click to vote
AI
2003
Springer
15 years 9 months ago
2003
Springer
The prediction of a protein’s structure from its amino-acid sequence is one of the most important problems in computational biology. In the current focus on a widely studied abst...
148
click to vote
DBA
2004
15 years 5 months ago
2004
In order to guarantee efficient query processing together with industrial strength, spatial index structures have to be integrated into fully-fledged object-relational database ma...
150
click to vote
WSCG
2004
15 years 5 months ago
2004
Accurately and automatically conveying the structure of a volume model is a problem not fully solved by existing volume rendering approaches. Physics-based volume rendering approa...
149
click to vote
ESA
2003
Springer
15 years 9 months ago
2003
Springer
We propose a new complexity measure for movement of objects, the smoothed motion complexity. Many applications are based on algorithms dealing with moving objects, but usually data...
147
click to vote
ML
2010
ACM
15 years 2 months ago
2010
ACM
Abstract A dynamic programming algorithm for constructing optimal dyadic decision trees was recently introduced, analyzed, and shown to be very effective for low dimensional data ...