1635 search results - page 84 / 327 » Reasoning from Data Rather than Theory |
ERSHOV
1989
Springer
14 years 1 months ago
1989
Springer
This paper reports two experiments with implementations of constructions from theoretical computer science. The first one deals with Kleene’s and Rogers’ second recursion the...
DEXA
2004
Springer
14 years 20 days ago
2004
Springer
Abstract. Mobile devices are capable of retrieving and processing data from remote databases. In a wireless data transmission environment, users are typically charged by the size o...
COLING
2008
13 years 10 months ago
2008
In this paper we explore robustness and domain adaptation issues for Word Sense Disambiguation (WSD) using Singular Value Decomposition (SVD) and unlabeled data. We focus on the s...
CAEPIA
2007
Springer
14 years 3 months ago
2007
Springer
We introduce a non-admissible heuristic for planning with action costs, called the set-additive heuristic, that combines the benefits of the additive heuristic used in the HSP pla...
LICS
2012
IEEE
11 years 11 months ago
2012
IEEE
—Data trees are trees in which each node, besides carrying a label from a finite alphabet, also carries a data value infinite domain. They have been used as an abstraction mode...