Sciweavers

1449 search results - page 203 / 290
» Finiteness results for sigmoidal
Sort
View
SCN
2008
Springer
126views Communications» more  SCN 2008»
15 years 6 months ago
Faster Multi-exponentiation through Caching: Accelerating (EC)DSA Signature Verification
We consider the task of computing power productsQ 1ik gei i ("multi-exponentiation") where base elements g2, . . ., gk are fixed while g1 is variable between multi-expone...
Bodo Möller, Andy Rupp
SIAMDM
2008
105views more  SIAMDM 2008»
15 years 6 months ago
Average Spectra and Minimum Distances of Low-Density Parity-Check Codes over Abelian Groups
Ensembles of regular low-density parity-check codes over any finite Abelian group G are studied. The nonzero entries of the parity matrix are randomly chosen, independently and uni...
Giacomo Como, Fabio Fagnani
SIAMJO
2008
100views more  SIAMJO 2008»
15 years 6 months ago
On the Global Solution of Linear Programs with Linear Complementarity Constraints
This paper presents a parameter-free integer-programming based algorithm for the global resolution of a linear program with linear complementarity constraints (LPCC). The cornersto...
Jing Hu, John E. Mitchell, Jong-Shi Pang, Kristin ...
SIAMJO
2008
85views more  SIAMJO 2008»
15 years 6 months ago
Explicit Reformulations for Robust Optimization Problems with General Uncertainty Sets
We consider a rather general class of mathematical programming problems with data uncertainty, where the uncertainty set is represented by a system of convex inequalities. We prove...
Igor Averbakh, Yun-Bin Zhao
ENTCS
2000
97views more  ENTCS 2000»
15 years 6 months ago
Complexity of Weak Bisimilarity and Regularity for BPA and BPP
It is an open problem whether weak bisimilarity is decidable for Basic Process Algebra (BPA) and Basic Parallel Processes (BPP). A PSPACE lower bound for BPA and NP lower bound fo...
Jirí Srba