Sciweavers

170 search results - page 12 / 34
» Cross-Composition: A New Technique for Kernelization Lower B...
Sort
View
ICASSP
2011
IEEE
12 years 11 months ago
Exploring implicit score normalization techniques in speaker verification
In this paper we first introduce four kinds of modification of Symmetric Scoring [1] which produce likelihood ratios that do not need to be explicitly normalized, i.e. T-norm, Z...
Ce Zhang, Rong Zheng, Bo Xu
COCO
2009
Springer
78views Algorithms» more  COCO 2009»
14 years 2 months ago
Fixed-Polynomial Size Circuit Bounds
—In 1982, Kannan showed that ΣP 2 does not have nk -sized circuits for any k. Do smaller classes also admit such circuit lower bounds? Despite several improvements of Kannan’s...
Lance Fortnow, Rahul Santhanam, Ryan Williams
ISPD
1998
ACM
88views Hardware» more  ISPD 1998»
13 years 12 months ago
An efficient technique for device and interconnect optimization in deep submicron designs
In this paper, we formulate a new class of optimization problem, named the general CH-posynomial program, and reveal the general dominance property. We propose an efcient algorith...
Jason Cong, Lei He
GLVLSI
2000
IEEE
116views VLSI» more  GLVLSI 2000»
14 years 2 days ago
Reducing bus transition activity by limited weight coding with codeword slimming
Transitions on high capacitance busses in VLSI systems result in considerable power dissipation. Various coding schemes have been proposed in literature to encode the input signal...
Vijay Sundararajan, Keshab K. Parhi
SAT
2007
Springer
121views Hardware» more  SAT 2007»
14 years 1 months ago
MiniMaxSat: A New Weighted Max-SAT Solver
In this paper we introduce MINIMAXSAT, a new Max-SAT solver that incorporates the best SAT and Max-SAT techniques. It can handle hard clauses (clauses of mandatory satisfaction as ...
Federico Heras, Javier Larrosa, Albert Oliveras