1813 search results - page 287 / 363 » Calculi of Approximation Spaces |
203
click to vote
OOPSLA
2000
Springer
15 years 7 months ago
2000
Springer
Propagation-based call graph construction algorithms have been studied intensively in the 1990s, and differ primarily in the number of sets that are used to approximate run-time v...
137
click to vote
RSCTC
2000
Springer
15 years 7 months ago
2000
Springer
Abstract. Classic parsing methods are based on complete search techniques to find the different interpretations of a sentence. However, the size of the search space increases expon...
140
click to vote
ICML
1994
IEEE
15 years 7 months ago
1994
IEEE
With the goal of reducing computational costs without sacrificing accuracy, we describe two algorithms to find sets of prototypes for nearest neighbor classification. Here, the te...
129
click to vote
ICML
1994
IEEE
15 years 7 months ago
1994
IEEE
Compositional Q-Learning (CQ-L) (Singh 1992) is a modular approach to learning to performcomposite tasks made up of several elemental tasks by reinforcement learning. Skills acqui...
137
click to vote
ICPR
2010
IEEE
15 years 7 months ago
2010
IEEE
This work introduces a new pattern recognition model for segmenting and tracking lip contours in video sequences. We formulate the problem as a general nonrigid object tracking me...