Sciweavers

4940 search results - page 301 / 988
» On the Complexity of Universal Programs
Sort
View
CVPR
2007
IEEE
16 years 8 months ago
Solving Large Scale Binary Quadratic Problems: Spectral Methods vs. Semidefinite Programming
In this paper we introduce two new methods for solving binary quadratic problems. While spectral relaxation methods have been the workhorse subroutine for a wide variety of comput...
Carl Olsson, Anders P. Eriksson, Fredrik Kahl
ICML
2007
IEEE
16 years 7 months ago
Discriminant kernel and regularization parameter learning via semidefinite programming
Regularized Kernel Discriminant Analysis (RKDA) performs linear discriminant analysis in the feature space via the kernel trick. The performance of RKDA depends on the selection o...
Jieping Ye, Jianhui Chen, Shuiwang Ji
ICML
2000
IEEE
16 years 7 months ago
Version Space Algebra and its Application to Programming by Demonstration
Machine learning research has been very successful at producing powerful, broadlyapplicable classification learners. However, many practical learning problems do not fit the class...
Tessa A. Lau, Pedro Domingos, Daniel S. Weld
CBMS
2009
IEEE
16 years 1 months ago
HL7 healthcare information management using aspect-oriented programming
Given the heterogeneity of healthcare software systems, data from each system is often incompatible inhibiting interoperability. To enable the sharing and exchange of healthcare i...
Jennifer Munnelly, Siobhán Clarke
TACAS
2009
Springer
136views Algorithms» more  TACAS 2009»
16 years 1 months ago
Path Feasibility Analysis for String-Manipulating Programs
We discuss the problem of path feasibility for programs manipulating strings using a collection of standard string library functions. We prove results on the complexity of this pro...
Nikolaj Bjørner, Nikolai Tillmann, Andrei V...