Sciweavers

2607 search results - page 154 / 522
» Complete Functional Synthesis
Sort
View
ICML
2007
IEEE
16 years 4 months ago
On learning linear ranking functions for beam search
Beam search is used to maintain tractability in large search spaces at the expense of completeness and optimality. We study supervised learning of linear ranking functions for con...
Yuehua Xu, Alan Fern
POPL
2002
ACM
16 years 4 months ago
Adaptive functional programming
An adaptive computation maintains the relationship between its input and output as the input changes. Although various techniques for adaptive computing have been proposed, they r...
Umut A. Acar, Guy E. Blelloch, Robert Harper
ICC
2009
IEEE
165views Communications» more  ICC 2009»
15 years 10 months ago
Arbitrarily Tight Upper and Lower Bounds on the Gaussian Q-Function and Related Functions
—We present a new family of tight lower and upper bounds on the Gaussian Q-function Q(x). It is first shown that, for any x, the integrand ϕ(θ; x) of the Craig representation ...
Giuseppe Thadeu Freitas de Abreu
WCRE
2008
IEEE
15 years 10 months ago
An Empirical Study of Function Clones in Open Source Software
The new hybrid clone detection tool NICAD combines the strengths and overcomes the limitations of both textbased and AST-based clone detection techniques to yield highly accurate ...
Chanchal Kumar Roy, James R. Cordy
CTRSA
2007
Springer
111views Cryptology» more  CTRSA 2007»
15 years 10 months ago
A Practical and Tightly Secure Signature Scheme Without Hash Function
In 1999, two signature schemes based on the flexible RSA problem (a.k.a. strong RSA problem) were independently introduced: the Gennaro-Halevi-Rabin (GHR) signature scheme and the...
Benoît Chevallier-Mames, Marc Joye