Now showing items 1-2 of 2

    • Convexity and logical analysis of data 

      Ekin, O.; Hammer, P. L.; Kogan, A. (Elsevier, 2000)
      A Boolean function is called k-convex if for any pair x,y of its true points at Hamming distance at most k, every point "between" x and y is also true. Given a set of true points and a set of false points, the central ...
    • A unified approach to universal prediction: Generalized upper and lower bounds 

      Vanli, N. D.; Kozat, S. S. (Institute of Electrical and Electronics Engineers Inc., 2015)
      We study sequential prediction of real-valued, arbitrary, and unknown sequences under the squared error loss as well as the best parametric predictor out of a large, continuous class of predictors. Inspired by recent results ...