Sciweavers

963 search results - page 34 / 193
» On the decomposition of rational functions
Sort
View
IWOCA
2009
Springer
123views Algorithms» more  IWOCA 2009»
14 years 3 months ago
Computability of Width of Submodular Partition Functions
The notion of submodular partition functions generalizes many of well-known tree decompositions of graphs. For fixed k, there are polynomial-time algorithms to determine whether ...
Petr Skoda
ICDM
2006
IEEE
158views Data Mining» more  ICDM 2006»
14 years 2 months ago
A Probability Distribution Of Functional Random Variable With A Functional Data Analysis Application
Probability distributions are central tools for probabilistic modeling in data mining, and they lack in functional data analysis (FDA). In this paper we propose a probability dist...
Etienne Cuvelier, Monique Noirhomme-Fraiture
ISSAC
2005
Springer
83views Mathematics» more  ISSAC 2005»
14 years 2 months ago
A procedure for proving special function inequalities involving a discrete parameter
We define a class of special function inequalities that contains many classical examples, such as the Cauchy-Schwarz inequality, and introduce a proving procedure based on induct...
Stefan Gerhold, Manuel Kauers
VLSID
2004
IEEE
108views VLSI» more  VLSID 2004»
14 years 9 months ago
Boolean Decomposition Using Two-literal Divisors
This paper is an attempt to answer the following question: how much improvement can be obtained in logic decomposition by using Boolean divisors? Traditionally, the existence of t...
Nilesh Modi, Jordi Cortadella
WG
2005
Springer
14 years 2 months ago
Algebraic Operations on PQ Trees and Modular Decomposition Trees
Partitive set families are families of sets that can be quite large, but have a compact, recursive representation in the form of a tree. This tree is a common generalization of PQ...
Ross M. McConnell, Fabien de Montgolfier