9719 search results - page 313 / 1944 » Answer Set Optimization |
205
click to vote
RSCTC
2000
Springer
15 years 10 months ago
2000
Springer
The main task in decision tree construction algorithms is to find the "best partition" of the set of objects. In this paper, we investigate the problem of optimal binary ...
136
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Huffman coding finds an optimal prefix code for a given probability mass function. Consider situations in which one wishes to find an optimal code with the restriction that all cod...
310
click to vote
ICDE
2007
IEEE
16 years 8 months ago
2007
IEEE
Keyword search is a familiar and potentially effective way to find information of interest that is "locked" inside relational databases. Current work has generally assum...
323
click to vote
ICDE
2007
IEEE
16 years 8 months ago
2007
IEEE
The ability to store and query uncertain information is of great benefit to databases that infer values from a set of observations, including databases of moving objects, sensor r...
184
click to vote
ICDE
2009
IEEE
16 years 1 months ago
2009
IEEE
— Given a large graph and a set of objects, the task of object connection discovery is to find a subgraph that retains the best connection between the objects. Object connection...