Sciweavers

8431 search results - page 409 / 1687
» Algorithmically Independent Sequences
Sort
View
ICALP
2000
Springer
15 years 10 months ago
Two-coloring Random Hypergraphs
: 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...
COLT
2008
Springer
15 years 8 months ago
Time Varying Undirected Graphs
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
CIMAGING
2008
122views Hardware» more  CIMAGING 2008»
15 years 8 months ago
Online consistency checking for AM-FM target tracks
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...
EUSFLAT
2007
108views Fuzzy Logic» more  EUSFLAT 2007»
15 years 8 months ago
Lattice-Valued Possibilistic Entropy Functions
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 ...
Ivan Kramosil
EUSFLAT
2003
15 years 8 months ago
Minimisation of the expected weighted number of jobs being late with fuzzy processing time in a one machine system
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...
Barbara Gladysz, Dorota Kuchta