1368 search results - page 24 / 274 » Generalized Rook Polynomials |
ICGI
2010
Springer
13 years 9 months ago
2010
Springer
We recapitulate regular one-shot learning from membership and equivalence queries, positive and negative finite data. We present a meta-algorithm that generalizes over as many sett...
CORR
2006
Springer
13 years 8 months ago
2006
Springer
Toric codes are obtained by evaluating rational functions of a nonsingular toric variety at the algebraic torus. One can extend toric codes to the so called generalized toric code...
ICDT
2010
ACM
13 years 7 months ago
2010
ACM
We propose a greedy algorithm which, given a hypergraph H and a positive integer k, produces a hypertree decomposition of width less than or equal to 3k −1, or determines that H...
CPC
2006
13 years 8 months ago
2006
We generalize and unify results on parametrized and coloured Tutte polynomials of graphs and matroids due to Zaslavsky [Trans. Amer. Math. Soc. 334 (1992), 317-347] and Bollob
MP
2006
13 years 8 months ago
2006
Although the general linear complementarity problem (LCP) is NP-complete, there are special classes that can be solved in polynomial time. One example is the type where the definin...