Sciweavers

206 search results - page 7 / 42
» On the numbers of variables to represent sparse logic functi...
Sort
View
ADCM
2004
58views more  ADCM 2004»
13 years 7 months ago
On the Representation of Band-Dominant Functions on the Sphere Using Finitely Many Bits
A band-dominant function on the Euclidean sphere embedded in Rq+1 is the restriction to this sphere of an entire function of q + 1 complex variables having a finite exponential ty...
Hrushikesh Narhar Mhaskar, Francis J. Narcowich, J...
ICML
2010
IEEE
13 years 8 months ago
Submodular Dictionary Selection for Sparse Representation
We develop an efficient learning framework to construct signal dictionaries for sparse representation by selecting the dictionary columns from multiple candidate bases. By sparse,...
Andreas Krause, Volkan Cevher
UAI
2003
13 years 8 months ago
CLP(BN): Constraint Logic Programming for Probabilistic Knowledge
Abstract. In Datalog, missing values are represented by Skolem constants. More generally, in logic programming missing values, or existentially quantified variables, are represent...
Vítor Santos Costa, David Page, Maleeha Qaz...
VLSID
1998
IEEE
105views VLSI» more  VLSID 1998»
13 years 11 months ago
Optimizing Logic Design Using Boolean Transforms
When a Boolean function is transformed by exclusiveOR with a suitably selected transform function, the new functzon is often synthesized wzth significantly reduced hardware. `I�...
Pramit Chavda, James Jacob, Vishwani D. Agrawal
ML
2002
ACM
127views Machine Learning» more  ML 2002»
13 years 7 months ago
Sparse Regression Ensembles in Infinite and Finite Hypothesis Spaces
We examine methods for constructing regression ensembles based on a linear program (LP). The ensemble regression function consists of linear combinations of base hypotheses generat...
Gunnar Rätsch, Ayhan Demiriz, Kristin P. Benn...