4074 search results - page 231 / 815 » Defining Computational Aesthetics |
109
Voted
JFPLC
2000
15 years 2 months ago
2000
ABSTRACT. This paper focuses on the assignment of meaning to some nonterminating SLD derivations in logic programming. Several approaches have been developped by considering infini...
COLING
1994
15 years 2 months ago
1994
This paper presents the results of an experiment usiug machine-readable dictionaries (Mill)s) and corpora for building concatenativc units for text to speech (T'PS) systems. ...
98
Voted
AAAI
1990
15 years 1 months ago
1990
Cost-based abduction attempts to find the best explanation for a set of facts by finding a minimal cost proof for the facts. The costs are computed by summing the costs of the ass...
101
Voted
ECAI
2010
Springer
15 years 1 months ago
2010
Springer
We introduce First Order ProbLog, an extension of first order logic with soft constraints where formulas are guarded by probabilistic facts. The paper defines a semantics for FOPro...
92
Voted
ESA
2010
Springer
15 years 1 months ago
2010
Springer
We define the robustness of a level set homology class of a function f : X R as the magnitude of a perturbation necessary to kill the class. Casting this notion into a group theor...