464 search results - page 17 / 93 » Subsystem Based Generalizations of Rough Set Approximations |
IJCAI
2003
14 years 10 months ago
2003
A longstanding goal in planning research is the ability to generalize plans developed for some set of environments to a new but similar environment, with minimal or no replanning....
70
Voted
NIPS
2008
14 years 11 months ago
2008
A novel center-based clustering algorithm is proposed in this paper. We first formulate clustering as an NP-hard linear integer program and we then use linear programming and the ...
CDC
2010
IEEE
14 years 4 months ago
2010
IEEE
Approximate policy iteration methods based on temporal differences are popular in practice, and have been tested extensively, dating to the early nineties, but the associated conve...
CVPR
2006
IEEE
15 years 3 months ago
2006
IEEE
This paper describes an algorithm for pose and illumination invariant face recognition from a single image under occlusions. The method iteratively estimates the parameters of a 3...
76
Voted
SDM
2009
SIAM
15 years 6 months ago
2009
SIAM
In this paper, we propose GAD (General Activity Detection) for fast clustering on large scale data. Within this framework we design a set of algorithms for different scenarios: (...