Sciweavers

928 search results - page 149 / 186
» The degree structure of Weihrauch-reducibility
Sort
View
TNN
1998
125views more  TNN 1998»
13 years 9 months ago
Symbolic connectionism in natural language disambiguation
Abstract—Natural language understanding involves the simultaneous consideration of a large number of different sources of information. Traditional methods employed in language an...
Samuel W. K. Chan, James Franklin
UMUAI
1998
157views more  UMUAI 1998»
13 years 9 months ago
Bayesian Models for Keyhole Plan Recognition in an Adventure Game
We present an approach to keyhole plan recognition which uses a dynamic belief (Bayesian) network to represent features of the domain that are needed to identify users’ plans and...
David W. Albrecht, Ingrid Zukerman, Ann E. Nichols...
MST
2007
167views more  MST 2007»
13 years 9 months ago
The Complexity of Polynomial-Time Approximation
In 1996, Khanna and Motwani [KM96] proposed three logic-based optimization problems constrained by planar structure, and offered the hypothesis that these putatively fundamental ...
Liming Cai, Michael R. Fellows, David W. Juedes, F...
PAAPP
2007
109views more  PAAPP 2007»
13 years 9 months ago
Relation rule mining
\Web users are nowadays confronted with the huge variety of available information sources whose content is not targeted at any specific group or layer. Recommendation systems aim...
Mehdi Adda, Rokia Missaoui, Petko Valtchev
TCS
2010
13 years 8 months ago
Cops and Robbers from a distance
Cops and Robbers is a pursuit and evasion game played on graphs that has received much attention. We consider an extension of Cops and Robbers, distance k Cops and Robbers, where t...
Anthony Bonato, Ehsan Chiniforooshan, Pawel Pralat