16430 search results - page 320 / 3286 » On Computable Tree Functions |
140
click to vote
MPC
1995
Springer
15 years 8 months ago
1995
Springer
PVS is a highly automated framework for speci cation and veri cation. We show how the language and deduction features of PVS can be used to formalize, mechanize, and apply some us...
115
click to vote
BMCBI
2010
15 years 5 months ago
2010
We study the shape of coverage functions resulting from the sequencing of random genome fragments, and show that they can be described by Galton-Watson trees. This extends standar...
116
click to vote
MFCS
1990
Springer
15 years 9 months ago
1990
Springer
We introduce the notion of associative one-way functions and prove that they exist if and only if P 6= NP. As evidence of their utility, we present two novel protocols that apply ...
141
click to vote
HICSS
1994
IEEE
15 years 8 months ago
1994
IEEE
Meeting memory features are poorly integrated into current group support systems (GSS). This paper discusses how to introduce meeting memory functionality into a GSS. The paper fi...
154
click to vote
IJACTAICIT
2010
15 years 2 months ago
2010
This paper describes new proposed algorithms for constructing the transfer function of nth order Butterworth LPF using the idea of the cascade combination of active filters. Compu...