806 search results - page 61 / 162 » An Optimal Dynamic Data Structure for Stabbing-Semigroup Que... |
ISI
2008
Springer
13 years 9 months ago
2008
Springer
Pervasive information systems give an overview of what digital environments should look like in the future. From a data-centric point of view, traditional databases have to be used...
ML
2010
ACM
13 years 7 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 ...
FOCS
2000
IEEE
14 years 1 months ago
2000
IEEE
We consider the planar point location problem from the perspective of expected search time. We are given a planar polygonal subdivision S and for each polygon of the subdivision t...
SIGMOD
2002
ACM
14 years 9 months ago
2002
ACM
Spatial indexing has been one of the active focus areas in recent database research. Several variants of Quadtree and R-tree indexes have been proposed in database literature. In ...
ICML
2009
IEEE
14 years 9 months ago
2009
IEEE
This paper addresses exact learning of Bayesian network structure from data and expert's knowledge based on score functions that are decomposable. First, it describes useful ...