Sciweavers

4820 search results - page 488 / 964
» Implementing Signatures for C
Sort
View
MOC
2000
80views more  MOC 2000»
15 years 6 months ago
A modification of Shanks' baby-step giant-step algorithm
Abstract. I describe a modification to Shanks' baby-step giant-step algorithm for computing the order n of an element g of a group G, assuming n is finite. My method has the a...
David C. Terr
RAS
2000
90views more  RAS 2000»
15 years 6 months ago
Cooperative transport by ants and robots
In several species of ants, workers cooperate to retrieve large prey. Usually, one ant finds a prey item, tries to move it, and when unsuccessful for some time, recruits nestmates...
C. Ronald Kube, Eric Bonabeau
CN
1998
58views more  CN 1998»
15 years 6 months ago
A solid modeling library for the World Wide Web
A library of functions for the creation, manipulation, and viewing of solid models was created for deployment on the World Wide Web. The core data structure was based on the halfe...
Stephen Chi-fai Chan, Vincent T. Y. Ng, Albert S. ...
IJON
2002
98views more  IJON 2002»
15 years 6 months ago
Blind deconvolution by simple adaptive activation function neuron
The `Bussgang' algorithm is one among the most known blind deconvolution techniques in the adaptive signal processing literature. It relies on a Bayesian estimator of the sou...
Simone Fiori
IWC
2002
207views more  IWC 2002»
15 years 6 months ago
Developing adaptable user interfaces for component-based systems
Software components are becoming increasingly popular design and implementation technologies that can be plugged and played to provide user-enhanceable software. However, developi...
John C. Grundy, John G. Hosking