Sciweavers

13784 search results - page 197 / 2757
» On Computing Functions with Uncertainty
Sort
View
MPC
1995
Springer
116views Mathematics» more  MPC 1995»
14 years 23 days ago
Computer-Aided Computing
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...
Natarajan Shankar
MFCS
1990
Springer
14 years 1 months ago
One-Way Functions in Complexity Theory
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 ...
Alan L. Selman
HICSS
1994
IEEE
117views Biometrics» more  HICSS 1994»
14 years 22 days ago
Providing for Organizational Memory in Computer-Supported Meetings
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...
Gerhard Schwabe
IJACTAICIT
2010
127views more  IJACTAICIT 2010»
13 years 6 months ago
New Proposed Algorithms for nth Order Butterworth Active Filter Computer-Aided Design
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...
Haider Fakher Radhi Al-Saidy
MFCS
1993
Springer
14 years 1 months ago
Real Number Computability and Domain Theory
We present the different constructive definitions of real number that can be found in the literature. Using domain theory we analyse the notion of computability that is substant...
Pietro Di Gianantonio