Sciweavers

975 search results - page 52 / 195
» Locality Optimization for Program Instances
Sort
View
IJCNN
2006
IEEE
15 years 3 months ago
Learning to Rank by Maximizing AUC with Linear Programming
— Area Under the ROC Curve (AUC) is often used to evaluate ranking performance in binary classification problems. Several researchers have approached AUC optimization by approxi...
Kaan Ataman, W. Nick Street, Yi Zhang
CADE
2010
Springer
14 years 11 months ago
Automated Synthesis of Induction Axioms for Programs with Second-Order Recursion
In order to support the verification of programs, verification tools such as ACL2 or Isabelle try to extract suitable induction axioms from the definitions of terminating, recursiv...
Markus Aderhold
CORR
2010
Springer
88views Education» more  CORR 2010»
14 years 9 months ago
Grothendieck inequalities for semidefinite programs with rank constraint
Grothendieck inequalities are fundamental inequalities which are frequently used in many areas of mathematics and computer science. They can be interpreted as upper bounds for the ...
Jop Briët, Fernando Mário de Oliveira ...
OOPSLA
2010
Springer
14 years 7 months ago
Encapsulation and locality: a foundation for concurrency support in multi-language virtual machines?
We propose to search for common abstractions for different concurrency models to enable high-level language virtual machines to support a wide range of different concurrency model...
Stefan Marr
SCIA
2009
Springer
183views Image Analysis» more  SCIA 2009»
15 years 4 months ago
Globally Optimal Least Squares Solutions for Quasiconvex 1D Vision Problems
Abstract. Solutions to non-linear least squares problems play an essential role in structure and motion problems in computer vision. The predominant approach for solving these prob...
Carl Olsson, Martin Byröd, Fredrik Kahl