Sciweavers

97 search results - page 7 / 20
» Graphs of arbitrary excessive class
Sort
View
TIT
2002
95views more  TIT 2002»
15 years 1 months ago
On sequential strategies for loss functions with memory
The problem of optimal sequential decision for individual sequences, relative to a class of competing o -line reference strategies, is studied for general loss functions with memo...
Neri Merhav, Erik Ordentlich, Gadiel Seroussi, Mar...
ICIP
2008
IEEE
16 years 3 months ago
Partial difference equations on graphs for Mathematical Morphology operators over images and manifolds
The main tools of Mathematical Morphology are a broad class of nonlinear image operators. They can be defined in terms of algebraic set operators or as Partial Differential Equati...
Vinh-Thong Ta, Abderrahim Elmoataz, Olivier Lezora...
118
Voted
UAI
2004
15 years 3 months ago
Convolutional Factor Graphs as Probabilistic Models
Based on a recent development in the area of error control coding, we introduce the notion of convolutional factor graphs (CFGs) as a new class of probabilistic graphical models. ...
Yongyi Mao, Frank R. Kschischang, Brendan J. Frey
117
Voted
ESA
2000
Springer
104views Algorithms» more  ESA 2000»
15 years 5 months ago
Efficient Algorithms for Centers and Medians in Interval and Circular-Arc Graphs
The p-center problem is to locate p facilities on a network so as to minimize the largest distance from a demand point to its nearest facility. The p-median problem is to locate p ...
Sergei Bespamyatnikh, Binay K. Bhattacharya, J. Ma...
124
Voted
ICALP
2011
Springer
14 years 5 months ago
Clique Clustering Yields a PTAS for max-Coloring Interval Graphs
We are given an interval graph G = (V, E) where each interval I ∈ V has a weight wI ∈ R+. The goal is to color the intervals V with an arbitrary number of color classes C1, C2...
Tim Nonner