Sciweavers

180 search results - page 13 / 36
» New Point Addition Formulae for ECC Applications
Sort
View
SIGMOD
2011
ACM
193views Database» more  SIGMOD 2011»
14 years 2 months ago
Fast checkpoint recovery algorithms for frequently consistent applications
Advances in hardware have enabled many long-running applications to execute entirely in main memory. As a result, these applications have increasingly turned to database technique...
Tuan Cao, Marcos Antonio Vaz Salles, Benjamin Sowe...
CSB
2004
IEEE
136views Bioinformatics» more  CSB 2004»
15 years 3 months ago
Minimum Entropy Clustering and Applications to Gene Expression Analysis
Clustering is a common methodology for analyzing the gene expression data. In this paper, we present a new clustering algorithm from an information-theoretic point of view. First,...
Haifeng Li, Keshu Zhang, Tao Jiang
MP
2008
117views more  MP 2008»
14 years 11 months ago
Multiplier convergence in trust-region methods with application to convergence of decomposition methods for MPECs
Abstract. We study piecewise decomposition methods for mathematical programs with equilibrium constraints (MPECs) for which all constraint functions are linear. At each iteration o...
Giovanni Giallombardo, Daniel Ralph
SAT
2009
Springer
153views Hardware» more  SAT 2009»
15 years 6 months ago
Does Advice Help to Prove Propositional Tautologies?
One of the starting points of propositional proof complexity is the seminal paper by Cook and Reckhow [6], where they defined propositional proof systems as poly-time computable f...
Olaf Beyersdorff, Sebastian Müller
FS
2006
135views more  FS 2006»
14 years 11 months ago
Asymmetric Information in Fads Models
Fads models were introduced by Shiller (1984) and Summers (1986) as plausible alternatives to the efficient markets/constant expected returns assumptions. Under these models, loga...
Paolo Guasoni