Sciweavers

3108 search results - page 303 / 622
» The Elements of Computer Credibility
Sort
View
JSC
2011
74views more  JSC 2011»
15 years 1 months ago
Constructive homomorphisms for classical groups
Let Ω ≤ GLd(q) be a quasisimple classical group in its natural representation and let ∆ = NGLd(q)(Ω). We construct the projection from ∆ to ∆/Ω and provide fast, poly...
Scott H. Murray, Colva M. Roney-Dougal
155
Voted
TCS
2011
15 years 1 months ago
Minimal non-convex words
Using a combinatorial characterization of digital convexity based on words, one defines the language of convex words. The complement of this language forms an ideal whose minimal...
Xavier Provençal
208
Voted
SIAMMAX
2010
97views more  SIAMMAX 2010»
15 years 1 months ago
Krylov Subspace Methods for Linear Systems with Tensor Product Structure
The numerical solution of linear systems with certain tensor product structures is considered. Such structures arise, for example, from the finite element discretization of a line...
Daniel Kressner, Christine Tobler
STOC
2012
ACM
251views Algorithms» more  STOC 2012»
13 years 9 months ago
Minimax option pricing meets black-scholes in the limit
Option contracts are a type of financial derivative that allow investors to hedge risk and speculate on the variation of an asset’s future market price. In short, an option has...
Jacob Abernethy, Rafael M. Frongillo, Andre Wibiso...
CASC
2009
Springer
103views Mathematics» more  CASC 2009»
16 years 1 months ago
Lazy and Forgetful Polynomial Arithmetic and Applications
We present lazy and forgetful algorithms for adding, multiplying and dividing multivariate polynomials. The lazy property allows us to compute the i-th term of a polynomial withou...
Michael B. Monagan, Paul Vrbik