Sciweavers

1757 search results - page 130 / 352
» Integrating and Extending JCSP
Sort
View
WSC
2000
14 years 11 months ago
Generating "dependent" quasi-random numbers
Under certain conditions on the integrand, quasi-Monte Carlo methods for estimating integrals (expectations) converge faster asymptotically than Monte Carlo methods. Motivated by ...
Shane G. Henderson, Belinda A. Chiera, Roger M. Co...
AMC
2007
86views more  AMC 2007»
14 years 10 months ago
Further refinement of pairing computation based on Miller's algorithm
In 2006, Blake, Murty and Xu proposed three refinements to Miller’s algorithm for computing Weil/Tate Pairings. In this paper we extend their work and propose a generalized algo...
Chao-Liang Liu, Gwoboa Horng, Te-Yu Chen
CORR
2008
Springer
154views Education» more  CORR 2008»
14 years 10 months ago
Approaching Blokh-Zyablov Error Exponent with Linear-Time Encodable/Decodable Codes
Guruswami and Indyk showed in [1] that Forney's error exponent can be achieved with linear coding complexity over binary symmetric channels. This paper extends this conclusion...
Zheng Wang, Jie Luo
CORR
2002
Springer
128views Education» more  CORR 2002»
14 years 9 months ago
The Deductive Database System LDL++
This paper describes the LDL++ system and the research advances that have enabled its design and development. We begin by discussing the new nonmonotonic and nondeterministic cons...
Faiz Arni, KayLiang Ong, Shalom Tsur, Haixun Wang,...
ML
2007
ACM
14 years 9 months ago
Learning deterministic context free grammars: The Omphalos competition
This paper describes the winning entry to the Omphalos context free grammar learning competition. Our approach integrates an information theoretic constituent likelihood measure to...
Alexander Clark