583 search results - page 66 / 117 » Efficient algorithms for constructing decision trees with co... |
SAC
2002
ACM
14 years 9 months ago
2002
ACM
The Peano Count Tree (P-tree) is a quadrant-based lossless tree representation of the original spatial data. The idea of P-tree is to recursively divide the entire spatial data, s...
CLUSTER
2002
IEEE
14 years 9 months ago
2002
IEEE
In this paper, we address the impact of resource limitations on the operation and performance of the broadcasting and multicasting schemes developed for infrastructureless wireless...
AAAI
2006
14 years 11 months ago
2006
We define TTD-MDPs, a novel class of Markov decision processes where the traditional goal of an agent is changed from finding an optimal trajectory through a state space to realiz...
124
click to vote
ICML
2000
IEEE
15 years 10 months ago
2000
IEEE
This paper has no novel learning or statistics: it is concerned with making a wide class of preexisting statistics and learning algorithms computationally tractable when faced wit...
FOCS
1992
IEEE
15 years 1 months ago
1992
IEEE
Partial types for the -calculus were introduced by Thatte in 1988 [3] as a means of typing objects that are not typable with simple types, such as heterogeneous lists and persiste...