Search results for "Computational problem"

showing 3 items of 13 documents

Synthetic phenomenology and high-dimensional buffer hypothesis

2012

Synthetic phenomenology typically focuses on the analysis of simplified perceptual signals with small or reduced dimensionality. Instead, synthetic phenomenology should be analyzed in terms of perceptual signals with huge dimensionality. Effective phenomenal processes actually exploit the entire richness of the dynamic perceptual signals coming from the retina. The hypothesis of a high-dimensional buffer at the basis of the perception loop that generates the robot synthetic phenomenology is analyzed in terms of a cognitive architecture for robot vision the authors have developed over the years. Despite the obvious computational problems when dealing with high-dimensional vectors, spaces wit…

Settore ING-INF/05 - Sistemi Di Elaborazione Delle InformazioniExploitbusiness.industrymedia_common.quotation_subjectSynthetic phenomenologyCognitive architecturecognitive vision systems CiceRobotMaxima and minimaCiceRobot.Artificial IntelligencePerceptionhigh-dimensional bufferRobotComputer visioncognitive vision systemArtificial intelligenceComputational problemPsychologybusinessPhenomenology (psychology)Curse of dimensionalitymedia_common
researchProduct

New client puzzle approach for DoS resistance in ad hoc Networks

2010

In this paper we propose a new client puzzle approach to prevent Denial of Service (DoS) attacks in ad hoc networks. Each node in the network first solves a computational problem and with the solution has to create and solve a client puzzle. By combining computational problems with puzzles, we improve the efficiency and latency of the communicating nodes and resistance in DoS attacks. Experimental results show the effectiveness of our approach.

business.industryWireless ad hoc networkComputer scienceServerMathematicsofComputing_GENERALCryptographyDenial-of-service attackComputational problemLatency (engineering)businessQA76Computer network2010 IEEE International Conference on Information Theory and Information Security
researchProduct

PUNAS: A Parallel Ungapped-Alignment-Featured Seed Verification Algorithm for Next-Generation Sequencing Read Alignment

2017

The progress of next-generation sequencing has a major impact on medical and genomic research. This technology can now produce billions of short DNA fragments (reads) in a single run. One of the most demanding computational problems used by almost every sequencing pipeline is short-read alignment; i.e. determining where each fragment originated from in the original genome. Most current solutions are based on a seed-and-extend approach, where promising candidate regions (seeds) are first identified and subsequently extended in order to verify whether a full high-scoring alignment actually exists in the vicinity of each seed. Seed verification is the main bottleneck in many state-of-the-art a…

chemistry.chemical_compoundSpeedupchemistryComputer scienceGenomicsParallel computingComputational problemGenomeAlgorithmDNA sequencingDNA2017 IEEE International Parallel and Distributed Processing Symposium (IPDPS)
researchProduct