Sciweavers

86 search results - page 6 / 18
» Combinatorics of generalized q-Euler numbers
Sort
View
CVPR
2012
IEEE
11 years 10 months ago
Unsupervised learning of translation invariant occlusive components
We study unsupervised learning of occluding objects in images of visual scenes. The derived learning algorithm is based on a probabilistic generative model which parameterizes obj...
Zhenwen Dai, Jörg Lücke
COCOON
2007
Springer
14 years 1 months ago
Connected Coloring Completion for General Graphs: Algorithms and Complexity
An r-component connected coloring of a graph is a coloring of the vertices so that each color class induces a subgraph having at most r connected components. The concept has been w...
Benny Chor, Michael R. Fellows, Mark A. Ragan, Igo...
COMPGEOM
2006
ACM
14 years 1 months ago
Random triangulations of planar point sets
Let S be a finite set of n + 3 points in general position in the plane, with 3 extreme points and n interior points. We consider triangulations drawn uniformly at random from the...
Micha Sharir, Emo Welzl
COCOON
2006
Springer
13 years 11 months ago
Approximating Min-Max (Regret) Versions of Some Polynomial Problems
Abstract. While the complexity of min-max and min-max regret versions of most classical combinatorial optimization problems has been thoroughly investigated, there are very few stu...
Hassene Aissi, Cristina Bazgan, Daniel Vanderpoote...
COMBINATORICS
2006
126views more  COMBINATORICS 2006»
13 years 7 months ago
The Induced Subgraph Order on Unlabelled Graphs
A differential poset is a partially ordered set with raising and lowering operators U and D which satisfy the commutation relation DU-UD = rI for some constant r. This notion may ...
Craig A. Sloss