01498nas 2200397 450 99000348729020331620110208100910.00018-9200000348729USA01000348729(ALEPH)000348729USA0100034872920110121a----9999km-y-itay50------baengUSAafazz--||||IEEE journal of solid-state circuitsInstitute of Electrical and Electronics Engineers. Solid State Circuits. CouncilNew YorkInstitute of Electrical and Electronics Engineersv.ill.24 cmComincia nel 1966Descrizione basata su Vol.38, n.2(2003)-MensileElettrotecnicaPeriodiciBNCF621.305Institute of Electrical and Electronics Engineers. Solid State Circuits. CouncilITsalbcISBDhttp://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=4.Online da workstation autorizzate990003487290203316SCIPER IV1973-1974; 1977-1998; 2000-2009;1973-1974; 1977-1980; 1987; 1994-1996; 1998; 2000; 2003;SECIANATIEMP9020110121USA011120CIANATIEMP9020110121USA011215CIANATIEMP9020110127USA011056CIANATIEMP9020110208USA011009IEEE journal of solid-state circuits796229UNISA06515nam 22008895 450 99646583570331620230406034142.01-282-33200-797866123320053-642-03367-910.1007/978-3-642-03367-4(CKB)1000000000761213(EBL)450538(OCoLC)437347237(SSID)ssj0000288526(PQKBManifestationID)11242701(PQKBTitleCode)TC0000288526(PQKBWorkID)10382547(PQKB)11050335(DE-He213)978-3-642-03367-4(MiAaPQ)EBC450538(MiAaPQ)EBC6413349(PPN)13631094X(EXLCZ)99100000000076121320100301d2009 u| 0engur|n|---|||||txtccrAlgorithms and Data Structures[electronic resource] 11th International Symposium, WADS 2009, Banff, Canada, August 21-23, 2009. Proceedings /edited by Frank Dehne, Jörg-Rüdiger Sack, Csaba D. Toth1st ed. 2009.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,2009.1 online resource (588 p.)Theoretical Computer Science and General Issues,2512-2029 ;5664Description based upon print version of record.3-642-03366-0 Includes bibliographical references and index.On the Power of the Semi-Separated Pair Decomposition -- Plane Graphs with Parity Constraints -- Straight-Line Rectangular Drawings of Clustered Graphs -- Online Priority Steiner Tree Problems -- Connect the Dot: Computing Feed-Links with Minimum Dilation -- Minimal Locked Trees -- Approximating Transitive Reductions for Directed Networks -- 1.25-Approximation Algorithm for Steiner Tree Problem with Distances 1 and 2 -- Succinct Orthogonal Range Search Structures on a Grid with Applications to Text Indexing -- A Distribution-Sensitive Dictionary with Low Space Overhead -- A Comparison of Performance Measures for Online Algorithms -- Delaunay Triangulation of Imprecise Points Simplified and Extended -- An Improved SAT Algorithm in Terms of Formula Length -- Shortest Path Problems on a Polyhedral Surface -- Approximation Algorithms for Buy-at-Bulk Geometric Network Design -- Rank-Sensitive Priority Queues -- Algorithms Meet Art, Puzzles, and Magic -- Skip-Splay: Toward Achieving the Unified Bound in the BST Model -- Drawing Graphs with Right Angle Crossings -- Finding a Hausdorff Core of a Polygon: On Convex Polygon Containment with Bounded Hausdorff Distance -- Efficient Construction of Near-Optimal Binary and Multiway Search Trees -- On the Approximability of Geometric and Geographic Generalization and the Min-Max Bin Covering Problem -- On Reconfiguration of Disks in the Plane and Related Problems -- Orientation-Constrained Rectangular Layouts -- The h-Index of a Graph and Its Application to Dynamic Subgraph Statistics -- Optimal Embedding into Star Metrics -- Online Square Packing -- Worst-Case Optimal Adaptive Prefix Coding -- New Results on Visibility in Simple Polygons -- Dynamic Graph Clustering Using Minimum-Cut Trees -- Rank-Balanced Trees -- Approximation Algorithms for Finding a Minimum Perimeter Polygon Intersecting a Set of Line Segments -- Reconfiguration of List Edge-Colorings in a Graph -- The Simultaneous Representation Problem for Chordal, Comparability and Permutation Graphs -- Two for One: Tight Approximation of 2D Bin Packing -- Fault Tolerant External Memory Algorithms -- Inspecting a Set of Strips Optimally -- A Pseudopolynomial Algorithm for Alexandrov’s Theorem -- A Scheme for Computing Minimum Covers within Simple Regions -- Better Approximation Algorithms for the Maximum Internal Spanning Tree Problem -- Two Approximation Algorithms for ATSP with Strengthened Triangle Inequality -- Streaming Embeddings with Slack -- Computing the Implicit Voronoi Diagram in Triple Precision -- Efficient Approximation of Combinatorial Problems by Moderately Exponential Algorithms -- Integer Programming: Optimization and Evaluation Are Equivalent -- Resolving Loads with Positive Interior Stresses -- On Making Directed Graphs Transitive -- Bit-Parallel Tree Pattern Matching Algorithms for Unordered Labeled Trees -- Compact and Low Delay Routing Labeling Scheme for Unit Disk Graphs.This book constitutes the refereed proceedings of the 11th Algorithms and Data Structures Symposium, WADS 2009, held in Banff, Canada, in August 2009. The Algorithms and Data Structures Symposium - WADS (formerly "Workshop on Algorithms and Data Structures") is intended as a forum for researchers in the area of design and analysis of algorithms and data structures. The 49 revised full papers presented in this volume were carefully reviewed and selected from 126 submissions. The papers present original research on algorithms and data structures in all areas, including bioinformatics, combinatorics, computational geometry, databases, graphics, and parallel and distributed computing.Theoretical Computer Science and General Issues,2512-2029 ;5664Computer programmingAlgorithmsArtificial intelligence—Data processingComputer science—MathematicsDiscrete mathematicsComputer graphicsNumerical analysisProgramming TechniquesAlgorithmsData ScienceDiscrete Mathematics in Computer ScienceComputer GraphicsNumerical AnalysisComputer programming.Algorithms.Artificial intelligence—Data processing.Computer science—Mathematics.Discrete mathematics.Computer graphics.Numerical analysis.Programming Techniques.Algorithms.Data Science.Discrete Mathematics in Computer Science.Computer Graphics.Numerical Analysis.511.3Dehne FrankWADS 2009MiAaPQMiAaPQMiAaPQBOOK996465835703316Algorithms and Data Structures1967417UNISA09384nam 22008055 450 99646587230331620230330004428.03-642-33266-810.1007/978-3-642-33266-1(CKB)3400000000086237(SSID)ssj0000767452(PQKBManifestationID)11423990(PQKBTitleCode)TC0000767452(PQKBWorkID)10741350(PQKB)11710745(DE-He213)978-3-642-33266-1(MiAaPQ)EBC3070264(PPN)168323974(EXLCZ)99340000000008623720120919d2012 u| 0engurnn|008mamaatxtccrArtificial Neural Networks and Machine Learning -- ICANN 2012[electronic resource] 22nd International Conference on Artificial Neural Networks, Lausanne, Switzerland, September 11-14, 2012, Proceedings, Part II /edited by Alessandro Villa, Włodzisław Duch, Péter Érdi, Francesco Masulli, Günther Palm1st ed. 2012.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,2012.1 online resource (XXVIII, 590 p. 172 illus.) Theoretical Computer Science and General Issues,2512-2029 ;7553International conference proceedings.3-642-33265-X Includes bibliographical references and author index.Complex-Valued Multilayer Perceptron Search Utilizing Eigen Vector Descent and Reducibility -- Theoretical Analysis of Function of Derivative Term in On-Line Gradient Descent Learning -- Some Comparisons of Networks with Radial and Kernel -- Multilayer Perceptron for Label Ranking -- Electricity Load Forecasting: A Weekday-Based -- Adaptive Exploration Using Stochastic Neurons -- Comparison of Long-Term Adaptivity for Neural Networks -- Simplifying ConvNets for Fast Learning -- A Modified Artificial Fish Swarm Algorithm for the Optimization of Extreme Learning Machines -- Robust Training of Feedforward Neural Networks Using Combined Online/Batch Quasi-Newton Techniques -- Estimating a Causal Order among Groups of Variables in Linear Models -- Training Restricted Boltzmann Machines with Multi-tempering: Harnessing Parallelization -- A Computational Geometry Approach for Pareto-Optimal Selection of Neural Networks -- Learning Parameters of Linear Models in Compressed Parameter Space -- Control of a Free-Falling Cat by Policy-Based Reinforcement Learning -- Gated Boltzmann Machine in Texture Modeling -- Neural PCA and Maximum Likelihood Hebbian Learning on the GPU -- Construction of Emerging Markets Exchange Traded Funds Using Multiobjective Particle Swarm Optimisation -- The Influence of Supervised Clustering for RBFNN Centers Definition: A Comparative Study -- Nested Sequential Minimal Optimization for Support Vector Machines -- Random Subspace Method and Genetic Algorithm Applied to a LS-SVM Ensemble -- Text Recognition in Videos Using a Recurrent Connectionist Approach -- An Investigation of Ensemble Systems Applied to Encrypted and Cancellable Biometric Data -- New Dynamic Classifiers Selection Approach for Handwritten Recognition -- Vector Perceptron Learning Algorithm Using Linear Programming -- TrueSkill-Based Pairwise Coupling for Multi-class Classification -- Analogical Inferences in the Family Trees Task: A Review -- An Efficient Way of Combining SVMs for Handwritten Digit Recognition -- Comparative Evaluation of Regression Methods for 3D-2D Image Registration -- A MDRNN-SVM Hybrid Model for Cursive Offline Handwriting Recognition -- Extraction of Prototype-Based Threshold Rules Using Neural Training Procedure -- Instance Selection with Neural Networks for Regression Problems -- A New Distance for Probability Measures Based on the Estimation of Level Sets -- Low Complexity Proto-Value Function Learning from Sensory Observations with Incremental Slow Feature Analysis -- Improving Neural Networks Classification through Chaining -- Feature Ranking Methods Used for Selection of Prototypes -- A “Learning from Models” Cognitive Fault Diagnosis System -- Improving ANNs Performance on Unbalanced Data with an AUC-Based Learning Algorithm -- Learning Using Privileged Information in Prototype Based Models -- A Sparse Support Vector Machine Classifier with Nonparametric Discriminants -- Training Mahalanobis Kernels by Linear Programming -- Correntropy-Based Document Clustering via Nonnegative Matrix Factorization -- SOMM – Self-Organized Manifold Mapping -- Self-Organizing Map and Tree Topology for Graph Summarization -- Variable-Sized Kohonen Feature Map Probabilistic Associative Memory -- Learning Deep Belief Networks from Non-stationary Streams -- Separation and Unification of Individuality and Collectivity and Its Application to Explicit Class Structure in Self-Organizing Maps -- Autoencoding Ground Motion Data for Visualisation -- Examining an Evaluation Mechanism of Metaphor Generation with Experiments and Computational Model Simulation -- Pairwise Clustering with t-PLSI -- Selecting β-Divergence for Nonnegative Matrix Factorization by Score Matching -- Neural Networks for Proof-Pattern Recognition -- Using Weighted Clustering and Symbolic Data to Evaluate Institutes Scientific Production -- Comparison of Input Data Compression Methods in Neural Network Solution of Inverse Problem in Laser Raman Spectroscopy of Natural Waters -- New Approach for Clustering Relational Data Based on Relationship and Attribute Information -- Comparative Study on Information Theoretic Clustering and Classical Clustering Algorithms -- Text Mining for Wellbeing: Selecting Stories Using Semantic and Pragmatic Features -- Hybrid Bilinear and Trilinear Models for Exploratory Analysis of Three-Way Poisson Counts -- and Machine Learning Algorithms -- Rademacher Complexity and Structural Risk Minimization: An Application to Human Gene Expression Datasets -- Using a Support Vector Machine and Sampling to Classify Compounds as Potential Transdermal Enhancers -- The Application of Gaussian Processes in the Predictions of Permeability across Mammalian Membranes -- Protein Structural Blocks Representation and Search through Unsupervised NN -- Evolutionary Support Vector Machines for Time Series Forecasting -- Learning Relevant Time Points for Time-Series Data in the Life Sciences -- A Multivariate Approach to Estimate Complexity of FMRI Time Series -- Neural Architectures for Global Solar Irradiation and Air Temperature Prediction -- Sparse Linear Wind Farm Energy Forecast -- Diffusion Maps and Local Models for Wind Power Prediction -- A Hybrid Model for S&P500 Index Forecasting.The two-volume set LNCS 7552 + 7553 constitutes the proceedings of the 22nd International Conference on Artificial Neural Networks, ICANN 2012, held in Lausanne, Switzerland, in September 2012. The 162 papers included in the proceedings were carefully reviewed and selected from 247 submissions. They are organized in topical sections named: theoretical neural computation; information and optimization; from neurons to neuromorphism; spiking dynamics; from single neurons to networks; complex firing patterns; movement and motion; from sensation to perception; object and face recognition; reinforcement learning; bayesian and echo state networks; recurrent neural networks and reservoir computing; coding architectures; interacting with the brain; swarm intelligence and decision-making; mulitlayer perceptrons and kernel networks; training and learning; inference and recognition; support vector machines; self-organizing maps and clustering; clustering, mining and exploratory analysis; bioinformatics; and time weries and forecasting.Theoretical Computer Science and General Issues,2512-2029 ;7553Artificial intelligenceComputer scienceAlgorithmsPattern recognition systemsApplication softwareComputer visionArtificial IntelligenceTheory of ComputationAlgorithmsAutomated Pattern RecognitionComputer and Information Systems ApplicationsComputer VisionArtificial intelligence.Computer science.Algorithms.Pattern recognition systems.Application software.Computer vision.Artificial Intelligence.Theory of Computation.Algorithms.Automated Pattern Recognition.Computer and Information Systems Applications.Computer Vision.006.3Villa Alessandroedthttp://id.loc.gov/vocabulary/relators/edtDuch Włodzisławedthttp://id.loc.gov/vocabulary/relators/edtÉrdi Péteredthttp://id.loc.gov/vocabulary/relators/edtMasulli Francescoedthttp://id.loc.gov/vocabulary/relators/edtPalm Güntheredthttp://id.loc.gov/vocabulary/relators/edtBOOK996465872303316Artificial Neural Networks and Machine Learning -- ICANN 20122830506UNISA01255nam a2200289 i 450099100334312970753620020503190645.0000505s1923 it ||| | lat b1049182x-39ule_instEXGIL119190ExLBiblioteca Interfacoltàita018.142Biblioteca universitaria <Sassari>469142Librorum saec. 15. impressorum qui in Bibliotheca universitatia studiorum Sassarensis adservantur :catalogus /Fridericus AgenoFlorentiae :Olschki,192348 p. ;25 cmBiblioteca di bibliografia italiana ;3IncunaboliCataloghiSassariBiblioteca universitariaCataloghiAgeno, Federicoauthorhttp://id.loc.gov/vocabulary/relators/aut230918.b1049182x21-02-1727-06-02991003343129707536LE002 SB 018.142 IT SSLE002 Bibl. I D 212002000417480le002-E0.00-no 00000.i1056777x27-06-02Librorum saec. 15. impressorum qui in Bibliotheca universitatia studiorum Sassarensis adservantur1446095UNISALENTOle00201-01-00ma -latit 01