Sciweavers

2477 search results - page 403 / 496
» Approximate extended formulations
Sort
View
NIPS
2004
13 years 11 months ago
Efficient Kernel Discriminant Analysis via QR Decomposition
Linear Discriminant Analysis (LDA) is a well-known method for feature extraction and dimension reduction. It has been used widely in many applications such as face recognition. Re...
Tao Xiong, Jieping Ye, Qi Li, Ravi Janardan, Vladi...
IJCAI
2003
13 years 11 months ago
Employing Trainable String Similarity Metrics for Information Integration
The problem of identifying approximately duplicate objects in databases is an essential step for the information integration process. Most existing approaches have relied on gener...
Mikhail Bilenko, Raymond J. Mooney
STRINGOLOGY
2004
13 years 11 months ago
Conditional Inequalities and the Shortest Common Superstring Problem
We investigate the shortest common superstring problem (SCSSP). As SCSSP is APX-complete it cannot be approximated within an arbitrarily small performance ratio. One heuristic tha...
Uli Laube, Maik Weinard
AAAI
1998
13 years 11 months ago
Bayesian Q-Learning
A central problem in learning in complex environmentsis balancing exploration of untested actions against exploitation of actions that are known to be good. The benefit of explora...
Richard Dearden, Nir Friedman, Stuart J. Russell
IMAGING
2000
13 years 11 months ago
Illuminant Estimation: Beyond the Bases
We describe spectral estimation principles that are useful for color balancing, color conversion, and sensor design. The principles extend conventional estimation methods, which r...
Jeffrey M. DiCarlo, Brian A. Wandell