72 search results - page 3 / 15 » Integral trees with given nullity |
109
Voted
ICALP
2003
Springer
15 years 6 months ago
2003
Springer
We consider requests for capacity in a given tree network T = (V, E) where each edge of the tree has some integer capacity ue. Each request consists of an integer demand df and a ...
108
Voted
CASES
2008
ACM
15 years 3 months ago
2008
ACM
The Field Programmable Compressor Tree (FPCT) is a programmable compressor tree (e.g., a Wallace or Dadda Tree) intended for integration in an FPGA or other reconfigurable device....
DRMTICS
2005
Springer
15 years 6 months ago
2005
Springer
In this paper we propose a new scheme for software obfuscation and license protection that is based on an original transformation of the program’s call tree. The idea is based on...
94
Voted
ICML
2003
IEEE
16 years 1 months ago
2003
IEEE
Bayesian classifiers such as Naive Bayes or Tree Augmented Naive Bayes (TAN) have shown excellent performance given their simplicity and heavy underlying independence assumptions....
105
Voted
CORR
2011
Springer
14 years 8 months ago
2011
Springer
Let f be a univariate polynomial with real coefficients, f ∈ R[X]. Subdivision algorithms based on algebraic techniques (e.g., Sturm or Descartes methods) are widely used for is...