Zobrazeno 1 - 10
of 24
pro vyhledávání: '"Adam J. Grove"'
Publikováno v:
Computational Intelligence. 10:21-25
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6183849f9d882c1ef65105d6b36a03bd
https://doi.org/10.1111/j.1467-8640.1994.tb00141.x
https://doi.org/10.1111/j.1467-8640.1994.tb00141.x
Publikováno v:
Wildlife Society Bulletin. 33:74-80
Control of establishing conifers to lessen their impacts on understory is a contentious habitat issue throughout the western United States. Our objective was to model the effect of increasing Douglas-fir (Pseudotsuga menziesii) canopy cover on mounta
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b3525e298ee42dd26d15542c0dbf7e14
https://doi.org/10.2193/0091-7648(2005)33[74:deombs]2.0.co
https://doi.org/10.2193/0091-7648(2005)33[74:deombs]2.0.co
Publikováno v:
Machine Learning. 43:173-210
The problem of learning linear-discriminant concepts can be solved by various mistake-driven update procedures, including the Winnow family of algorithms and the well-known Perceptron algorithm. In this paper we define the general class of “quasi-a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5761993cc7ab2376325ec6866dad41a9
https://doi.org/10.1023/a:1010844028087
https://doi.org/10.1023/a:1010844028087
Autor:
Adam J. Grove, Dan Roth
Publikováno v:
Machine Learning. 42:123-141
We study a learning problem which allows for a “fair” comparison between unsupervised learning methods—probabilistic model construction, and more traditional algorithms that directly learn a classification. The merits of each approach are intui
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::41c9da12093a56f1c3a9c273bda58fb3
https://doi.org/10.1023/a:1007655119445
https://doi.org/10.1023/a:1007655119445
Publikováno v:
ICPR
We consider the problem of reconstructing the shape of a 2-D object from multiple partial images related by scaled translations, in the presence of occlusion. Lindenbaum and Bruckstein have considered this problem in the specific case of a translatin
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8483c41d2046493f7490544c29f904b3
https://doi.org/10.1016/s0031-3203(98)00050-8
https://doi.org/10.1016/s0031-3203(98)00050-8
Publikováno v:
Artificial Intelligence. 97:345-380
Most learning algorithms work most effectively when their training data contain completely specified labeled samples. In many diagnostic tasks, however, the data will include the values of only some of the attributes; we model this as a blocking proc
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ae61770aaf70e3e0b96ec34be82dbcab
https://doi.org/10.1016/s0004-3702(97)00048-9
https://doi.org/10.1016/s0004-3702(97)00048-9
Autor:
Adam J. Grove, Joseph Y. Halpern
Publikováno v:
Games and Economic Behavior. 20:51-65
Piccione and Rubinstein argue that a seemingly paradoxical form of time inconsistency can arise in games of imperfect recall. Their argument depends on calculating the expected value of a game from the standpoint of a player in the middle of play. We
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e9538248bd3724f3297cdaa34f913532
https://doi.org/10.1006/game.1997.0558
https://doi.org/10.1006/game.1997.0558
Publikováno v:
Journal of Symbolic Logic. 61:250-276
Motivated by problems that arise in computing degrees of belief, we consider the problem of computing asymptotic conditional probabilities for first-order sentences. Given first-order sentences φ and θ, we consider the structures with domain {1,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2fb40412f6921655304910a6cdc275fd
https://doi.org/10.2307/2275609
https://doi.org/10.2307/2275609
Publikováno v:
SIAM Journal on Computing. 25:1-51
Motivated by problems that arise in computing degrees of belief, we consider the problem of computing asymptotic conditional probabilities for first-order sentences. Given first-order sentences $\phi$ and $\theta$, we consider the structures with dom
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::75ec96be1979910eed3b7f087c16e64d
https://doi.org/10.1137/s0097539793257034
https://doi.org/10.1137/s0097539793257034
Publikováno v:
Journal of Artificial Intelligence Research. 4:37-59
In this paper we propose a dynamic data structure that supports efficient algorithms for updating and querying singly connected Bayesian networks (causal trees and polytrees). In the conventional algorithms, new evidence in absorbed in time O(1) and
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8c2a868b566be70a0555d019bae75633
https://doi.org/10.1613/jair.238
https://doi.org/10.1613/jair.238