Sciweavers

1257 search results - page 58 / 252
» A generalization of Euler's constant
Sort
View
ECCC
2011
223views ECommerce» more  ECCC 2011»
13 years 3 months ago
A Case of Depth-3 Identity Testing, Sparse Factorization and Duality
Polynomial identity testing (PIT) problem is known to be challenging even for constant depth arithmetic circuits. In this work, we study the complexity of two special but natural ...
Chandan Saha, Ramprasad Saptharishi, Nitin Saxena
ISLPED
2004
ACM
118views Hardware» more  ISLPED 2004»
14 years 2 months ago
On optimality of adiabatic switching in MOS energy-recovery circuit
The principle of adiabatic switching in conventional energyrecovery adiabatic circuit is generally explained in literature with the help of the rudimentary RC circuit driven by a ...
Baohua Wang, Pinaki Mazumder
BIRTHDAY
2006
Springer
14 years 18 days ago
Complete Categorical Deduction for Satisfaction as Injectivity
Birkhoff (quasi-)variety categorical axiomatizability results have fascinated many scientists by their elegance, simplicity and generality. The key factor leading to their generali...
Grigore Rosu
JMLR
2008
117views more  JMLR 2008»
13 years 8 months ago
Active Learning by Spherical Subdivision
We introduce a computationally feasible, "constructive" active learning method for binary classification. The learning algorithm is initially formulated for separable cl...
Falk-Florian Henrich, Klaus Obermayer
DAC
2007
ACM
14 years 10 months ago
Optimization of Area in Digital FIR Filters using Gate-Level Metrics
In the paper, we propose a new metric for the minimization of area in the generic problem of multiple constant multiplications, and demonstrate its effectiveness for digital FIR f...
Eduardo A. C. da Costa, José C. Monteiro, L...