Sciweavers

3007 search results - page 44 / 602
» Linear Functional Fixed-points
Sort
View
CIE
2008
Springer
14 years 11 months ago
Hybrid Functional Interpretations
We show how different functional interpretations can be combined via a multi-modal linear logic. A concrete hybrid of Kreisel's modified realizability and G
Mircea-Dan Hernest, Paulo Oliva
AMC
2006
105views more  AMC 2006»
14 years 9 months ago
Stable numerical methods for conservation laws with discontinuous flux function
We develop numerical methods for solving nonlinear equations of conservation laws with flux function that depends on discontinuous coefficients. Using a relaxation approximation, ...
Mohammed Seaïd
JCT
2000
103views more  JCT 2000»
14 years 9 months ago
A Combinatorial Algorithm Minimizing Submodular Functions in Strongly Polynomial Time
We give a strongly polynomial-time algorithm minimizing a submodular function f given by a value-giving oracle. The algorithm does not use the ellipsoid method or any other linear ...
Alexander Schrijver
STOC
2003
ACM
178views Algorithms» more  STOC 2003»
15 years 10 months ago
Uniform hashing in constant time and linear space
Many algorithms and data structures employing hashing have been analyzed under the uniform hashing assumption, i.e., the assumption that hash functions behave like truly random fu...
Anna Östlin, Rasmus Pagh
FOCM
2010
111views more  FOCM 2010»
14 years 7 months ago
A Note on the Finite Variance of the Averaging Function for Polynomial System Solving
In [BP08], the average complexity of linear homotopy methods to solve polynomial equations with random initial input (in a sense to be described below) was proven to be finite, an...
Carlos Beltrán, Michael Shub