tchnorider

public class BadVersion {
    
    public int badOne = 1;
    
    // AC
    public int firstBadVersion(int n) {
        int right = n;
        int left = 1;
        
         while(left < right) {

debasishg

1. Feature Learning

• Learning Feature Representations with K-means by Adam Coates and Andrew Y. Ng
• The devil is in the details: an evaluation of recent feature encoding methods by Chatfield et. al.
• Emergence of Object-Selective Features in Unsupervised Feature Learning by Coates, Ng
• Scaling Learning Algorithms towards AI Benjio & LeCun
• A Theory of Feature Learning by Brendan van Rooyen, Robert C. Williamson

2. Deep Learning

• Dropout: A Simple Way to Prevent Neural Networks from Overfitting by Nitish Srivastava, Geoffrey Hinton, Alex Krizhevsky, Ilya Sutskever and Ruslan Salakhutdinov
• [Understanding

LeCoupa

/* *******************************************************************************************
 * THE UPDATED VERSION IS AVAILABLE AT
 * https://github.com/LeCoupa/awesome-cheatsheets
 * ******************************************************************************************* */


// 0. Synopsis.
// http://nodejs.org/api/synopsis.html

jbro-io

public class AdvancedMath 
{
	public static Double standardDeviation(Double[] numbers)
	{
		//determine the sum of the range of numbers
		Double sum = 0;
		for(Double d : numbers)
		{
			sum += d;
		}

urielaero

#include <stdio.h>
#include <stdlib.h>
/*
Sencilla solución de el problema de las 8 reinas usando recursividad 
(backtracking), con arrays dinámicos. (Este código solo imprime una solución)
*/
int *crearVec(int t);
void llenarPositivo(int *v,int t);
void reinas(int i,int *vec,int *puesto,int *diag2_1,int *diag1_2);
void imp(int *vec);