Sciweavers

3179 search results - page 385 / 636
» Applications of PCF Theory
Sort
View
DCOSS
2006
Springer
14 years 1 months ago
Evaluating Local Contributions to Global Performance in Wireless Sensor and Actuator Networks
Wireless sensor networks are often studied with the goal of removing information from the network as efficiently as possible. However, when the application also includes an actuato...
Christopher J. Rozell, Don H. Johnson
ALT
2003
Springer
14 years 29 days ago
Can Learning in the Limit Be Done Efficiently?
Abstract. Inductive inference can be considered as one of the fundamental paradigms of algorithmic learning theory. We survey results recently obtained and show their impact to pot...
Thomas Zeugmann
ESOP
2000
Springer
14 years 28 days ago
Type Classes with Functional Dependencies
Abstract. Type classes in Haskell allow programmers to define functions that can be used on a set of different types, with a potentially different implementation in each case. For ...
Mark P. Jones
PKC
2000
Springer
118views Cryptology» more  PKC 2000»
14 years 27 days ago
An Identification Scheme Based on Sparse Polynomials
This paper gives a new example of exploiting the idea of using polynomials with restricted coefficients over finite fields and rings to construct reliable cryptosystems and identif...
William D. Banks, Daniel Lieman, Igor Shparlinski
COMPGEOM
1995
ACM
14 years 27 days ago
Approximate Range Searching
The range searching problem is a fundamental problem in computational geometry, with numerous important applications. Most research has focused on solving this problem exactly, bu...
Sunil Arya, David M. Mount