2370 search results - page 161 / 474 » The Characterization of Data-Accumulating Algorithms |
AIMSA
2000
Springer
15 years 1 months ago
2000
Springer
Abstract. Decision trees are considered as an efficient technique to express classification knowledge and to use it. However, their most standard algorithms do not deal with uncert...
CIE
2008
Springer
15 years 3 days ago
2008
Springer
The values of a two-player zero-sum binary discounted game are characterized by a P-matrix linear complementarity problem (LCP). Simple formulas are given to describe the data of t...
DCOSS
2008
Springer
14 years 12 months ago
2008
Springer
Abstract. Aiming at a realistic mobile connectivity model for vehicular sensor networks in urban environments, we propose the combination of large-scale traffic simulation and comp...
ECAI
2008
Springer
14 years 12 months ago
2008
Springer
We provide a characterization of Horn cores for formulas in conjunctive normal form (CNF) and, based on it, a novel algorithm for computing Horn cores of disjunctions of Horn CNFs ...
ACL
2001
14 years 11 months ago
2001
We offer a computational analysis of the resolution of ellipsis in certain cases of dialogue clarification. We show that this goes beyond standard techniques used in anaphora and ...