Sciweavers

1004 search results - page 12 / 201
» Product representations of polynomials
Sort
View
AAAI
2006
13 years 8 months ago
A BDD-Based Polytime Algorithm for Cost-Bounded Interactive Configuration
Interactive configurators are decision support systems assisting users in selecting values for parameters that respect given constraints. The underlying knowledge can be convenien...
Tarik Hadzic, Henrik Reif Andersen
COMBINATORICA
2008
84views more  COMBINATORICA 2008»
13 years 6 months ago
Parity check matrices and product representations of squares
Let NF(n, k, r) denote the maximum number of columns in an n-row matrix with entries in a finite field F in which each column has at most r nonzero entries and every k columns are...
Assaf Naor, Jacques Verstraëte
FUIN
2006
75views more  FUIN 2006»
13 years 6 months ago
Shuffle of Words and Araucaria Trees
The shuffle of words
René Schott, Jean-Claude Spehner
CORR
2012
Springer
209views Education» more  CORR 2012»
12 years 2 months ago
Aggregation in Probabilistic Databases via Knowledge Compilation
This paper presents a query evaluation technique for positive relational algebra queries with aggregates on a representation system for probabilistic data based on the algebraic s...
Robert Fink, Larisa Han, Dan Olteanu
CORR
2006
Springer
78views Education» more  CORR 2006»
13 years 6 months ago
Efficient algorithms for deciding the type of growth of products of integer matrices
For a given finite set of matrices with nonnegative integer entries we study the growth with t of max{ A1
Raphael M. Jungers, Vladimir Protasov, Vincent D. ...