Sciweavers

464 search results - page 14 / 93
» Subsystem Based Generalizations of Rough Set Approximations
Sort
View
CICLING
2009
Springer
14 years 10 months ago
Generalized Mongue-Elkan Method for Approximate Text String Comparison
Abstract. The Mongue-Elkan method is a general text string comparison method based on an internal character-based similarity measure (e.g. edit distance) combined with a token leve...
Sergio Jimenez, Claudia Becerra, Alexander F. Gelb...
AAAI
2008
14 years 11 months ago
Generalized Point Based Value Iteration for Interactive POMDPs
We develop a point based method for solving finitely nested interactive POMDPs approximately. Analogously to point based value iteration (PBVI) in POMDPs, we maintain a set of bel...
Prashant Doshi, Dennis Perez
PRL
2006
121views more  PRL 2006»
14 years 9 months ago
Information-preserving hybrid data reduction based on fuzzy-rough techniques
Data reduction plays an important role in machine learning and pattern recognition with a high-dimensional data. In real-world applications data usually exists with hybrid formats...
Qinghua Hu, Daren Yu, Zongxia Xie
WADS
2005
Springer
95views Algorithms» more  WADS 2005»
15 years 2 months ago
Improved Approximation Bounds for Planar Point Pattern Matching
We analyze the performance of simple algorithms for matching two planar point sets under rigid transformations so as to minimize the directed Hausdorff distance between the sets....
Minkyoung Cho, David M. Mount
JCAM
2011
69views more  JCAM 2011»
14 years 9 days ago
Comonotonic approximations for a generalized provisioning problem with application to optimal portfolio selection
In this paper we discuss multiperiod portfolio selection problems related to a speci…c provisioning problem. Our results are an extension of Dhaene et al. (2005), where optimal ...
Koen Van Weert, Jan Dhaene, Marc J. Goovaerts