3220 search results - page 452 / 644 » Constrained Graph Processes |
158
click to vote
FLAIRS
2001
15 years 7 months ago
2001
Partially Observable Markov Decision Process models (POMDPs) have been applied to low-level robot control. We show how to use POMDPs differently, namely for sensorplanning in the ...
165
click to vote
NIPS
2004
15 years 7 months ago
2004
Dominant sets are a new graph-theoretic concept that has proven to be relevant in pairwise data clustering problems, such as image segmentation. They generalize the notion of a ma...
185
click to vote
NIPS
2001
15 years 7 months ago
2001
We describe the application of kernel methods to Natural Language Processing (NLP) problems. In many NLP tasks the objects being modeled are strings, trees, graphs or other discre...
121
click to vote
COLING
1994
15 years 7 months ago
1994
: This paper is an introdnction to KASSYS, a system that has been designed to extract information from detining statements in natural language. Only hyperonymous detinitions are de...
156
click to vote
ICASSP
2010
IEEE
15 years 6 months ago
2010
IEEE
In this paper a large amount of absolute mean opinion scores obtained within a single listening test are presented. Naïve listeners’ preference on different speech signal prope...