Sciweavers

16430 search results - page 754 / 3286
» On Computable Tree Functions
Sort
View
ENTCS
2006
168views more  ENTCS 2006»
15 years 7 months ago
A Functional Programming Framework for Latency Insensitive Protocol Validation
Latency insensitive protocols (LIPs) have been proposed as a viable means to connect synchronous IP blocks via long interconnects in a system-on-chip. The reason why one needs to ...
Syed Suhaib, Deepak Mathaikutty, Sandeep K. Shukla...
PVLDB
2008
118views more  PVLDB 2008»
15 years 7 months ago
Efficient top-k processing over query-dependent functions
We study the efficient evaluation of top-k queries over data items, where the score of each item is dynamically computed by applying an item-specific function whose parameter valu...
Lin Guo, Sihem Amer-Yahia, Raghu Ramakrishnan, Jay...
JC
2011
87views more  JC 2011»
15 years 2 months ago
Lower bounds for the complexity of linear functionals in the randomized setting
Abstract. Hinrichs [3] recently studied multivariate integration defined over reproducing kernel Hilbert spaces in the randomized setting and for the normalized error criterion. I...
Erich Novak, Henryk Wozniakowski
DAC
2008
ACM
16 years 8 months ago
Bi-decomposing large Boolean functions via interpolation and satisfiability solving
Boolean function bi-decomposition is a fundamental operation in logic synthesis. A function f(X) is bi-decomposable under a variable partition XA, XB, XC on X if it can be written...
Ruei-Rung Lee, Jie-Hong Roland Jiang, Wei-Lun Hung
ICFP
2003
ACM
16 years 7 months ago
Functional automatic differentiation with dirac impulses
Functional Reactive Programming (FRP) is a framework for reactive programming in a functional setting. FRP has been applied to a number of domains, such as graphical animation, gr...
Henrik Nilsson