Sciweavers

696 search results - page 45 / 140
» A class of combinatorial identities
Sort
View
CCCG
2010
15 years 7 months ago
Some properties of higher order delaunay and gabriel graphs
We consider two classes of higher order proximity graphs defined on a set of points in the plane, namely, the k-Delaunay graph and the k-Gabriel graph. We give bounds on the follo...
Prosenjit Bose, Sébastien Collette, Ferran ...
UAI
2008
15 years 7 months ago
Complexity of Inference in Graphical Models
It is well-known that inference in graphical models is hard in the worst case, but tractable for models with bounded treewidth. We ask whether treewidth is the only structural cri...
Venkat Chandrasekaran, Nathan Srebro, Prahladh Har...
ARSCOM
2008
117views more  ARSCOM 2008»
15 years 6 months ago
Subset Counting in Trees
Various enumeration problems for classes of simply generated families of trees have been the object of investigation in the past. We mention the enumeration of independent subsets,...
Stephan G. Wagner
ENDM
2010
87views more  ENDM 2010»
15 years 6 months ago
Euler Complexes (Oiks)
We present a class of instances of the existence of a second object of a specified type, in fact, of an even number of objects of a specified type, which generalizes the existence...
Jack Edmonds
EJC
2008
15 years 6 months ago
Dyck paths with coloured ascents
We introduce a notion of Dyck paths with coloured ascents. For several ways of colouring, when the set of colours is itself some class of lattice paths, we establish bijections be...
Andrei Asinowski, Toufik Mansour