8838 search results - page 1426 / 1768 » Generalizing Domain Theory |
192
click to vote
NIPS
2003
15 years 8 months ago
2003
In this paper, sparse representation (factorization) of a data matrix is first discussed. An overcomplete basis matrix is estimated by using the K−means method. We have proved ...
179
click to vote
AAAI
2000
15 years 8 months ago
2000
Selective sampling, a form of active learning, reduces the cost of labeling training data by asking only for the labels of the most informative unlabeled examples. We introduce a ...
157
click to vote
AIPS
2000
15 years 8 months ago
2000
Currently, Graphplan and Blackbox, which converts Graphplan's plan graph into the satisfaction (SAT) problem, are two of the most successful planners. Since Graphplan gains i...
168
click to vote
AIPS
2000
15 years 8 months ago
2000
hsp and hspr are two recent planners that search the state-space using an heuristic function extracted from Strips encodings. hsp does a forward search from the initial state reco...
182
click to vote
FLAIRS
2000
15 years 8 months ago
2000
This paper describes a knowledge-based methodologyof miningtextual answersinto large collections of texts. Wepresent SOMBRERO,a knowledge processing module implemented in the LASS...