fastlib2/contrib/niche/kernel_vector_mult.h

@@ -501,7 +501,7 @@ class KernelVectorMult {
     /* Start recursion on the roots of either tree */
     GNPRecursion_(query_tree_, reference_tree_,
         MinNodeDistSq_(query_tree_, reference_tree_));
-    printf("queries_.n_rows() = %d\n", queries_.n_rows());
+    //printf("queries_.n_rows() = %d\n", queries_.n_rows());
     la::Scale(1 / epan_kernel.CalcNormConstant(queries_.n_rows()), &weighted_sums_);
 
     fx_timer_stop(module_, "dual_tree_computation");

fastlib2/contrib/niche/solvelinsys.cc

@@ -29,6 +29,7 @@ int main(int argc, char *argv[]) {
 
   SolveLinearSystem(references, right_hand_side_vec, bandwidth, sigma_squared, &solution);
 
+  //solution.PrintDebug("solution");
 
   // Finalize FastExec and print output results.
   fx_done();

fastlib2/contrib/niche/solvelinsys.h

@@ -158,11 +158,11 @@ public:
     // END FAST SUMMATION CODE
     
 
-
+    /*
     printf("data.n_rows() = %d\ndata.n_cols() = %d\n",
 	   data_.n_rows(),
 	   data_.n_cols());
-
+    */
     
     /*
     Vector K_i;