Sciweavers

42230 search results - page 350 / 8446
» Algorithms and Complexity Results for
Sort
View
ICCAD
1997
IEEE
171views Hardware» more  ICCAD 1997»
15 years 11 months ago
The disjunctive decomposition of logic functions
In this paper we present an algorithm for converting a BDD representation of a logic function into a multiple-level netlist of disjoint-support subfunctions. On the theoretical si...
Valeria Bertacco, Maurizio Damiani
145
Voted
STOC
1993
ACM
63views Algorithms» more  STOC 1993»
15 years 10 months ago
Some complexity issues on the simply connected regions of the two-dimensional plane
d Abstract) Arthur W. Chou1 and Ker-I Ko2 March 9, 1993
Arthur W. Chou, Ker-I Ko
JMLR
2010
143views more  JMLR 2010»
15 years 1 months ago
Rademacher Complexities and Bounding the Excess Risk in Active Learning
Sequential algorithms of active learning based on the estimation of the level sets of the empirical risk are discussed in the paper. Localized Rademacher complexities are used in ...
Vladimir Koltchinskii
CORR
2010
Springer
175views Education» more  CORR 2010»
15 years 3 months ago
Improving the Performance of maxRPC
Max Restricted Path Consistency (maxRPC) is a local consistency for binary constraints that can achieve considerably stronger pruning than arc consistency. However, existing maxRPC...
Thanasis Balafoutis, Anastasia Paparrizou, Kostas ...
ESA
2006
Springer
147views Algorithms» more  ESA 2006»
15 years 10 months ago
Univariate Polynomial Real Root Isolation: Continued Fractions Revisited
We present algorithmic, complexity and implementation results concerning real root isolation of integer univariate polynomials using the continued fraction expansion of real algeb...
Elias P. Tsigaridas, Ioannis Z. Emiris