Sciweavers

2268 search results - page 225 / 454
» The Essence of Form Abstraction
Sort
View
TCS
2011
14 years 8 months ago
Realizability models and implicit complexity
New, simple, proofs of soundness (every representable function lies in a given complexity class) for Elementary Affine Logic, LFPL and Soft Affine Logic are presented. The proofs ...
Ugo Dal Lago, Martin Hofmann
133
Voted
INFORMATICALT
2010
103views more  INFORMATICALT 2010»
14 years 8 months ago
Multistage K-Means Clustering for Scenario Tree Construction
Abstract. In stochastic programming and decision analysis, an important issue consists in the approximate representation of the multidimensional stochastic underlying process in th...
Kristina Sutiene, Dalius Makackas, Henrikas Pranev...
JCAM
2010
82views more  JCAM 2010»
14 years 8 months ago
Menke points on the real line and their connection to classical orthogonal polynomials
Abstract. We investigate the properties of extremal point systems on the real line consisting of two interlaced sets of points solving a modified minimum energy problem. We show th...
P. Mathur, J. S. Brauchart, Edward B. Saff
MOC
2010
14 years 8 months ago
A projection-based error analysis of HDG methods
Abstract. We introduce a new technique for the error analysis of hybridizable discontinuous Galerkin (HDG) methods. The technique relies on the use of a new projection whose design...
Bernardo Cockburn, Jayadeep Gopalakrishnan, Franci...
105
Voted
TIT
2011
152views more  TIT 2011»
14 years 8 months ago
Fast Exponentiation Using Split Exponents
Abstract—We propose a new method to speed up discrete logarithm (DL)-based cryptosystems by considering a new variant of the DL problem, where the exponents are formed as e1 + α...
Jung Hee Cheon, Stanislaw Jarecki, Taekyoung Kwon,...