20066 search results - page 230 / 4014 » T Spaces |
161
click to vote
IJCAI
2001
15 years 8 months ago
2001
A tight integration of Mitchell's version space algorithm with Agrawal et al.'s Apriori algorithm is presented. The algorithm can be used to generate patterns that satis...
176
click to vote
VISSYM
2004
15 years 8 months ago
2004
In volume visualization, users typically specify transfer functions to classify the data and assign visual attributes to each material class. Higher-dimensional classification mak...
197
click to vote
SEBD
1997
15 years 8 months ago
1997
M-tree is a dynamic access method suitable to index generic “metric spaces”, where the function used to compute the distance between any two objects satisfies the positivity, ...
185
click to vote
AAAI
1996
15 years 8 months ago
1996
Learning during backtrack search is a space-intensive process that records information (such as additional constraints) in order to avoid redundant work. In this paper, we analyze...
166
click to vote
NIPS
1993
15 years 8 months ago
1993
Parti-game is a new algorithm for learning feasible trajectories to goal regions in high dimensionalcontinuousstate-spaces. In high dimensions it is essential that learningdoes not...