Sciweavers

186 search results - page 33 / 38
» Computational Properties of Probabilistic Neural Networks
Sort
View
GLOBECOM
2006
IEEE
14 years 1 months ago
On the Feasibility of Very Low Complexity Trust Modules Using PKPS Synergies
Abstract— For many evolving application scenarios like ubiquitous and autonomic computing systems, trustworthy computing solutions are essential. However the fact that the autono...
Mahalingam Ramkumar
EVOW
2007
Springer
13 years 11 months ago
Evaluation of Different Metaheuristics Solving the RND Problem
RND (Radio Network Design) is a Telecommunication problem consisting in covering a certain geographical area by using the smallest number of radio antennas achieving the biggest co...
Miguel A. Vega-Rodríguez, Juan Antonio G&oa...
ASIAN
2004
Springer
180views Algorithms» more  ASIAN 2004»
14 years 28 days ago
Counting by Coin Tossings
Abstract. This text is an informal review of several randomized algorithms that have appeared over the past two decades and have proved instrumental in extracting efficiently quant...
Philippe Flajolet
ICISC
2008
103views Cryptology» more  ICISC 2008»
13 years 9 months ago
Generalized Universal Circuits for Secure Evaluation of Private Functions with Application to Data Classification
Secure Evaluation of Private Functions (PF-SFE) allows two parties to compute a private function which is known by one party only on private data of both. It is known that PF-SFE c...
Ahmad-Reza Sadeghi, Thomas Schneider 0003
IROS
2009
IEEE
174views Robotics» more  IROS 2009»
14 years 2 months ago
Characterization and modeling of wireless channels for networked robotic and control systems - a comprehensive overview
— The goal of this paper is to serve as a reference for researchers in robotics and control that are interested in realistic modeling, theoretical analysis and simulation of wire...
Yasamin Mostofi, Alejandro Gonzalez-Ruiz, Alireza ...