This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
/* Turn off features that will not work on Windows. | |
*/ | |
#define NGETRUSAGE | |
#define NALLSIGNALS |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#include "std_try.h" | |
#include <math.h> | |
using namespace Halide; | |
#define PI 3.14159 | |
/* | |
Interpolations | |
*/ |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
# Configure this makefile if needed then run | |
# $ make all | |
# to compile and link | |
# What files to compile | |
OBJS=money.cpp | |
# What file to compile to | |
MAINFILE=money | |
# What compiler to use | |
CC=g++ |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
""" | |
Implementation of pairwise ranking using scikit-learn LinearSVC | |
Reference: "Large Margin Rank Boundaries for Ordinal Regression", R. Herbrich, | |
T. Graepel, K. Obermayer. | |
Authors: Fabian Pedregosa <[email protected]> | |
Alexandre Gramfort <[email protected]> | |
""" |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
""" Module to compute projections on the positive simplex or the L1-ball | |
A positive simplex is a set X = { \mathbf{x} | \sum_i x_i = s, x_i \geq 0 } | |
The (unit) L1-ball is the set X = { \mathbf{x} | || x ||_1 \leq 1 } | |
Adrien Gaidon - INRIA - 2011 | |
""" | |
NewerOlder