Sciweavers

1809 search results - page 38 / 362
» Weakly Computable Real Numbers
Sort
View
APIN
2008
159views more  APIN 2008»
13 years 9 months ago
Soft computing techniques applied to finance
Soft computing is progressively gaining presence in the financial world. The number of real and potential applications is very large and, accordingly, so is the presence of applied...
Asunción Mochón, David Quintana, Yag...
ANTS
2000
Springer
92views Algorithms» more  ANTS 2000»
14 years 2 months ago
Computing Special Values of Partial Zeta Functions
We discuss computation of the special values of partial zeta functions associated to totally real number fields. The main tool is the Eisenstein cocycle Ψ, a group cocycle for GL...
Gautam Chinta, Paul E. Gunnells, Robert Sczech
JSC
2010
99views more  JSC 2010»
13 years 8 months ago
Faster algorithms for computing Hong's bound on absolute positiveness
We show how to compute Hong’s bound for the absolute positiveness of a polynomial in d variables with maximum degree δ in O(n logd n) time, where n is the number of non-zero co...
Kurt Mehlhorn, Saurabh Ray
IPPS
1998
IEEE
14 years 1 months ago
Network-Aware Distributed Computing: A Case Study
Abstract. The development of network-aware applications, i.e. applications that dynamically adapt to network conditions, has had some success in the domain of multimedia applicatio...
Hongsuda Tangmunarunkit, Peter Steenkiste
CRYPTO
2003
Springer
187views Cryptology» more  CRYPTO 2003»
14 years 2 months ago
On Constructing Locally Computable Extractors and Cryptosystems in the Bounded Storage Model
We consider the problem of constructing randomness extractors that are locally computable; that is, read only a small number of bits from their input. As recently shown by Lu (thi...
Salil P. Vadhan