Sciweavers

3007 search results - page 222 / 602
» Linear Functional Fixed-points
Sort
View
ICML
2008
IEEE
16 years 4 months ago
Localized multiple kernel learning
Recently, instead of selecting a single kernel, multiple kernel learning (MKL) has been proposed which uses a convex combination of kernels, where the weight of each kernel is opt...
Ethem Alpaydin, Mehmet Gönen
ESOP
2007
Springer
15 years 10 months ago
Computing Procedure Summaries for Interprocedural Analysis
Abstract. We describe a new technique for computing procedure summaries for performing an interprocedural analysis on programs. Procedure summaries are computed by performing a bac...
Sumit Gulwani, Ashish Tiwari
ICML
2004
IEEE
15 years 9 months ago
Optimising area under the ROC curve using gradient descent
This paper introduces RankOpt, a linear binary classifier which optimises the area under the ROC curve (the AUC). Unlike standard binary classifiers, RankOpt adopts the AUC stat...
Alan Herschtal, Bhavani Raskutti
SIAMCOMP
1998
92views more  SIAMCOMP 1998»
15 years 3 months ago
Surface Approximation and Geometric Partitions
Motivated by applications in computer graphics, visualization, and scienti c computation, we study the computational complexity of the following problem: Given a set S of n points...
Pankaj K. Agarwal, Subhash Suri
137
Voted
SAS
2010
Springer
140views Formal Methods» more  SAS 2010»
15 years 2 months ago
Multi-dimensional Rankings, Program Termination, and Complexity Bounds of Flowchart Programs
Abstract. Proving the termination of a flowchart program can be done by exhibiting a ranking function, i.e., a function from the program states to a wellfounded set, which strictl...
Christophe Alias, Alain Darte, Paul Feautrier, Lau...