: A 2-coloring of a hypergraph is a mapping from its vertex set to a set of two colors such that no edge is monochromatic. Let H = H k n p be a random k-uniform hypergraph on a ver...
Dimitris Achlioptas, Jeong Han Kim, Michael Krivel...
Undirected graphs are often used to describe high dimensional distributions. Under sparsity conditions, the graph can be estimated using 1 penalization methods. However, current m...
Shuheng Zhou, John D. Lafferty, Larry A. Wasserman
We compute AM-FM models for infrared video frames depicting military targets immersed in structured clutter backgrounds. We show that independent correlation based detection proce...
Nick A. Mould, Chuong T. Nguyen, Colin M. Johnston...
Lattice-valued entropy functions defined by a lattice-valued possibilistic distribution π on a space Ω are defined as the expected value (in the sense of Sugeno integral) of ...
One machine scheduling problem with fuzzy processing times and a penalty for each job being late (the penalty is independent of the magnitude of the lateness) is considered. The o...