Sciweavers

374 search results - page 17 / 75
» sum 2010
Sort
View
ENTCS
2006
144views more  ENTCS 2006»
13 years 9 months ago
Infinitary Howe's Method
Howe's method is a well-known technique for proving that various kinds of applicative bisimilarity (or similarity) on a functional language are congruences (or precongruences...
Paul Blain Levy
ISITA
2010
13 years 7 months ago
Approximating discrete probability distributions with causal dependence trees
Abstract--Chow and Liu considered the problem of approximating discrete joint distributions with dependence tree distributions where the goodness of the approximations were measure...
Christopher J. Quinn, Todd P. Coleman, Negar Kiyav...
GC
2010
Springer
13 years 8 months ago
Degree Bounded Spanning Trees
In this paper, we give a sufficient condition for a graph to have a degree bounded spanning tree. Let n ≥ 1, k ≥ 3, c ≥ 0 and G be an n-connected graph. Suppose that for eve...
Jun Fujisawa, Hajime Matsumura, Tomoki Yamashita
AAECC
2010
Springer
99views Algorithms» more  AAECC 2010»
13 years 10 months ago
Structural theorems for symbolic summation
Abstract. Starting with Karr's structural theorem for summation --the discrete version of Liouville's structural theorem for integration-- we work out crucial properties ...
Carsten Schneider
FFA
2010
84views more  FFA 2010»
13 years 8 months ago
Additive functions for number systems in function fields
Let Fq be a finite field with q elements and p ∈ Fq[X, Y ]. In this paper we study properties of additive functions with respect to number systems which are defined in the rin...
Manfred G. Madritsch, Jörg M. Thuswaldner