Sciweavers

709 search results - page 111 / 142
» An Equational Theory for Transactions
Sort
View
IJON
2007
184views more  IJON 2007»
14 years 11 months ago
Convex incremental extreme learning machine
Unlike the conventional neural network theories and implementations, Huang et al. [Universal approximation using incremental constructive feedforward networks with random hidden n...
Guang-Bin Huang, Lei Chen
TIT
2008
110views more  TIT 2008»
14 years 11 months ago
Explicit Codes Achieving List Decoding Capacity: Error-Correction With Optimal Redundancy
We present error-correcting codes that achieve the information-theoretically best possible trade-off between the rate and error-correction radius. Specifically, for every 0 < R...
Venkatesan Guruswami, Atri Rudra
SIGMETRICS
2010
ACM
212views Hardware» more  SIGMETRICS 2010»
15 years 4 months ago
A mean field model of work stealing in large-scale systems
In this paper, we consider a generic model of computational grids, seen as several clusters of homogeneous processors. In such systems, a key issue when designing efficient job al...
Nicolas Gast, Bruno Gaujal
CSL
2010
Springer
15 years 7 days ago
From Feasible Proofs to Feasible Computations
We shall discuss several situations in which it is possible to extract from a proof, be it a proof in a first-order theory or a propositional proof, some feasible computational inf...
Jan Krajícek
JCC
2002
127views more  JCC 2002»
14 years 10 months ago
Effective Born radii in the generalized Born approximation: The importance of being perfect
: Generalized Born (GB) models provide, for many applications, an accurate and computationally facile estimate of the electrostatic contribution to aqueous solvation. The GB models...
Alexey Onufriev, David A. Case, Donald Bashford