close
1.

電子ブック

EB
edited by Elisa Fromont, Tijl De Bie, Matthijs van Leeuwen
出版情報: Cham : Springer International Publishing : Imprint: Springer, 2015
シリーズ名: Lecture Notes in Computer Science ; 9385
オンライン: http://dx.doi.org/10.1007/978-3-319-24465-5
目次情報: 続きを見る
Data analytics and optimization for assessing a ride sharing system
Constraint-Based Querying for Bayesian Network Exploration
Efficient Model Selection for Regularized Classification by Exploiting Unlabeled Data
Segregation Discovery in a Social Network of Companies
A first+-order-logic based model for grounded language learning
A parallel distributed processing algorithm for image feature extraction
Modeling concept drift: A probabilistic graphical model based approach
Diversity-driven Widening of Hierarchical Agglomerative Clustering
Batch Steepest-Descent-Mildest-Ascent for Interactive Maximum Margin Clustering
Time Series Classification with Representation Ensembles
Simultaneous Clustering and Model Selection for Multinomial Distribution: A Comparative Study
On Binary Reduction of Large-scale Multiclass Classification Problems
Probabilistic Active Learning in Data Streams
Implicitly Constrained Semi-Supervised Least Squares Classification
Diagonal Co-clustering Algorithm for Document-Word Partitioning
I-Louvain: an attributed graph clustering method
Class-based outlier detection: staying zombies or awaiting for resurrection?
Using Metalearning for Prediction of Taxi Trip Duration Using Different Granularity Levels
Using entropy as a measure of acceptance for multi-label classification
Investigation of Node Deletion Techniques for Clustering Applications of Growing Self Organizing Maps
Exploratory topic modeling with distributional semantics
Assigning Geo-Relevance of Sentiments Mined from Location-Based Social Media Posts
Continuous and Discrete Deep Classifiers for Data Integration
A Bayesian Approach for Identifying Multivariate Differences Between Groups
Automatically Discovering Offensive Patterns in Soccer Match Data
Fast Algorithm Selection using Learning Curves
Optimally Weighted Cluster Kriging for Big Data Regression
Slower can be faster: The iRetis incremental model tree learner
VoQs: A Web Application for Visualization of Questionnaire Surveys
Data analytics and optimization for assessing a ride sharing system
Constraint-Based Querying for Bayesian Network Exploration
Efficient Model Selection for Regularized Classification by Exploiting Unlabeled Data
2.

電子ブック

EB
edited by Mohammad Reza Mousavi, Christian Berger
出版情報: Cham : Springer International Publishing : Imprint: Springer, 2015
シリーズ名: Lecture Notes in Computer Science ; 9361
オンライン: http://dx.doi.org/10.1007/978-3-319-25141-7
3.

電子ブック

EB
edited by Guojun Wang, Albert Zomaya, Gregorio Martinez Perez, Kenli Li
出版情報: Cham : Springer International Publishing : Imprint: Springer, 2015
シリーズ名: Lecture Notes in Computer Science ; 9532
オンライン: http://dx.doi.org/10.1007/978-3-319-27161-3
目次情報: 続きを見る
Trust, security and privacy for Big Data
Trust, security and privacy for emerging applications
Network optimization and performance evaluation
Sensor-cloud systems
Security and privacy protection in computer and network Systems
Dependability in sensor, cloud, and Big Data systems
Trust, security and privacy for Big Data
Trust, security and privacy for emerging applications
Network optimization and performance evaluation
4.

電子ブック

EB
edited by Emilio Di Giacomo, Anna Lubiw
出版情報: Cham : Springer International Publishing : Imprint: Springer, 2015
シリーズ名: Lecture Notes in Computer Science ; 9411
オンライン: http://dx.doi.org/10.1007/978-3-319-27261-0
目次情報: 続きを見る
Large and Dynamic Graphs
Crossing Numbers
Experiments
Area, Bends, Crossings
Intersection Representations
Applications
Drawings with Crossings
Polygons and Convexity
Drawing Graphs on Point Sets
Contact Representations
User Studies
Graph Drawing Contest
Graduate Workshop Report
Posters
Large and Dynamic Graphs
Crossing Numbers
Experiments
5.

電子ブック

EB
edited by Jan Vitek
出版情報: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2015
シリーズ名: Lecture Notes in Computer Science ; 9032
オンライン: http://dx.doi.org/10.1007/978-3-662-46669-8
目次情報: 続きを見る
Probabilistic Programs as Spreadsheet Queries
Static Analysis of Spreadsheet Applications for Type-Unsafe Operations Detection
Running Probabilistic Programs Backwards
A Verified Compiler for Probability Density Functions
Segment Abstraction for Worst-Case Execution Time Analysis
Automatic Static Cost Analysis for Parallel Programs
Sound, Modular and Compositional Verification of the Input/Output Behavior of Programs
Unrestricted Termination and Non-termination Arguments for Bit-Vector Programs. A Theory of Name Resolution
A Core Calculus for XQuery 3.0: Combining Navigational and Pattern Matching Approaches
IsoLate: A Type System for Self-recursion
The Problem of PL Concurrency Semantics
The Best of Both Worlds: Trading Efficiency and Optimality in Fence Insertion for TSO
Specifying and Verifying Concurrent Algorithms with Histories and Subjectivity
Witnessing (Co)datatypes
Making Random Judgments: Automatically Generating Well-Typed Terms from the Definition of a Type-System
Refinement Types for Incremental Computational Complexity
Monotonic References for Efficient Gradual Typing
Inter-procedural Two-Variable Herbrand Equalities
Desynchronized Multi-State Abstractions for Open Programs in Dynamic Languages
Fine-Grained Detection of Privilege Escalation Attacks on Browser Extensions
Analysis of Asynchronous Programs with Event-Based Synchronization
A Semantics for Propositions as Sessions
Composite Replicated Data Types
Relaxed Stratification: A New Approach to Practical Complete Predicate Refinement
Spatial Interpolants
Propositional Reasoning about Safety and Termination of Heap-Manipulating Programs
Full Reduction in the Face of Absurdity
CoLoSL: Concurrent Local Subjective Logic
A Separation Logic for Fictional Sequential Consistency
Binding Structures as an Abstract Data Type
Type-Based Allocation Analysis for Co-recursion in Lazy Functional Languages
Type Targeted Testing
Probabilistic Programs as Spreadsheet Queries
Static Analysis of Spreadsheet Applications for Type-Unsafe Operations Detection
Running Probabilistic Programs Backwards
6.

電子ブック

EB
edited by Magnus M. Halldorsson, Kazuo Iwama, Naoki Kobayashi, Bettina Speckmann
出版情報: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2015
シリーズ名: Lecture Notes in Computer Science ; 9134
オンライン: http://dx.doi.org/10.1007/978-3-662-47672-7
目次情報: 続きを見る
Statistical Randomized Encodings: A Complexity Theoretic View
Tighter Fourier Transform Lower Bounds
Quantifying Competitiveness in Paging with Locality of Reference
Approximation Algorithms for Computing Maximin Share Allocations
Envy-Free Pricing in Large Markets: Approximating Revenue and Welfare
Batched Point Location in SINR Diagrams via Algebraic Tools
On the Randomized Competitive Ratio of Reordering Buffer Management with Non-uniform Costs
Serving in the Dark Should Be Done Non-uniformly
Finding the Median (Obliviously) with Bounded Space
Approximation Algorithms for Min-Sum k-Clustering
Solving Linear Programming with Constraints Unknown
Deterministic Randomness Extraction from Generalized and Distributed Santha-Vazirani Sources
Limitations of Algebraic Approaches to Graph Isomorphism Testing
Fully Dynamic Matching in Bipartite Graphs
Feasible Interpolation for QBF Resolution Calculi
Simultaneous Approximation of Constraint Satisfaction Problems
Design of Dynamic Algorithms via Primal-Dual Method
What Percentage of Programs Halt?
The Parity of Set Systems Under Random Restrictions with Applications to Exponential Time Problems
Spotting Trees with Few Leaves
Constraint Satisfaction Problems over the Integers with Successor
Hardness Amplification and the Approximate Degree of Constant-Depth Circuits
Algorithms and Complexity for Turaev-Viro Invariants
Big Data on the Rise? ? Testing Monotonicity of Distributions
Unit Interval Editing Is Fixed-Parameter Tractable
Streaming Algorithms for Submodular Function Maximization
Multilinear Pseudorandom Functions
Zero-Fixing Extractors for Sub-Logarithmic Entropy
Interactive Proofs with Approximately Commuting Provers
Popular Matchings with Two-Sided Preferences and One-Sided Ties
Block Interpolation: A Framework for Tight Exponential-Time Counting Complexity
On Convergence and Threshold Properties of Discrete Lotka-Volterra Population Protocols
Scheduling Bidirectional Traffic on a Path
On the Problem of Approximating the Eigenvalues of Undirected Graphs in Probabilistic Logspace
On Planar Boolean CSP
On Temporal Graph Exploration
Mind Your Coins: Fully Leakage-Resilient Signatures with Graceful Degradation
A (1+e)-Embedding of Low Highway Dimension Graphs into Bounded Treewidth Graphs
Lower Bounds for the Graph Homomorphism Problem
Parameterized Single-Exponential Time Polynomial Space Algorithm for Steiner Tree
Relative Discrepancy Does not Separate Information and Communication Complexity
A Galois Connection for Valued Constraint Languages of Infinite Size
Approximately Counting H Colourings Is #BIS-Hard
Taylor Polynomial Estimator for Estimating Frequency Moments
ETR-Completeness for Decision Versions of Multi-player (Symmetric) Nash Equilibria
Separate, Measure and Conquer: Faster Polynomial-Space Algorithms for Max 2-CSP and Counting Dominating Sets
Submatrix Maximum Queries in Monge Matrices Are Equivalent to Predecessor Search
Optimal Encodings for Range Top-k, Selection, and Min-Max
2-Vertex Connectivity in Directed Graphs
Ground State Connectivity of Local Hamiltonians
Uniform Kernelization Complexity of Hitting Forbidden Minors
Counting Homomorphisms to Square-Free Graphs, Modulo 2
Approximately Counting Locally-Optimal Structures
Proofs of Proximity for Context-Free Languages and Read-Once Branching Programs (Extended Abstract)
Fast Algorithms for Diameter-Optimally Augmenting Paths
Hollow Heaps
Linear-Time List Recovery of High-Rate Expander Codes
Finding 2-Edge and 2-Vertex Strongly Connected Components in Quadratic Time
Improved Algorithms for Decremental Single-Source Reachability on Directed Graphs
Weighted Reordering Buffer Improved via Variants of Knapsack Covering Inequalities
Local Reductions
Query Complexity in Expectation
Near-Linear Query Complexity for Graph Inference
A QPTAS for the Base of the Number of Crossing-Free Structures on a Planar Point Set
Finding a Path in Group-Labeled Graphs with Two Labels Forbidden
Lower Bounds for Sums of Powers of Low Degree Univariates
Approximating CSPs Using LP Relaxation
Comparator Circuits over Finite Bounded Posets
Algebraic Properties of Valued Constraint Satisfaction Problem
Towards Understanding the Smoothed Approximation Ratio of the 2-Opt Heuristic
On the Hardest Problem Formulations for the 0/1 Lasserre Hierarchy
Replacing Mark Bits with Randomness in Fibonacci Heaps
A PTAS for the Weighted Unit Disk Cover Problem
Approximating the Expected Values for Combinatorial Optimization Problems Over Stochastic Points
Deterministic Truncation of Linear Matroids
Linear Time Parameterized Algorithms for Subset Feedback Vertex Set
An Optimal Algorithm for Minimum-Link Rectilinear Paths in Triangulated Rectilinear Domains
Amplification of One-Way Information Complexity via Codes and Noise Sensitivity
A (2+e)-Approximation Algorithm for the Storage Allocation Problem
Shortest Reconfiguration Paths in the Solution Space of Boolean Formulas
Computing the Frechet Distance Between Polygons with Holes
An Improved Private Mechanism for Small Databases
Binary Pattern Tile Set Synthesis Is NP-Hard
Near-Optimal Upper Bound on Fourier Dimension of Boolean Functions in Terms of Fourier Sparsity
Condensed Unpredictability
Sherali-Adams Relaxations for Valued CSPs
Two-Sided Online Bipartite Matching and Vertex Cover: Beating the Greedy Algorithm
The Simultaneous Communication of Disjointness with Applications to Data Streams
An Improved Combinatorial Algorithm for Boolean Matrix Multiplication
Statistical Randomized Encodings: A Complexity Theoretic View
Tighter Fourier Transform Lower Bounds
Quantifying Competitiveness in Paging with Locality of Reference
7.

電子ブック

EB
edited by Francesco Masulli, Alfredo Petrosino, Stefano Rovetta
出版情報: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2015
シリーズ名: Lecture Notes in Computer Science ; 7627
オンライン: http://dx.doi.org/10.1007/978-3-662-48577-4
8.

電子ブック

EB
edited by Walfredo Cirne, Narayan Desai
出版情報: Cham : Springer International Publishing : Imprint: Springer, 2015
シリーズ名: Lecture Notes in Computer Science ; 8828
オンライン: http://dx.doi.org/10.1007/978-3-319-15789-4
目次情報: 続きを見る
Bubble Task:?A Dynamic Execution Throttling Method for Multi-core Resource Management
Real-World Clustering for Task Graphs on Shared Memory Systems
Experimental Analysis of the Tardiness of Parallel Tasks in Soft Real-time Systems
Multi-Resource Aware Fairsharing for Heterogeneous Systems
Priority Operators for Fairshare Scheduling
User-Aware Metrics for Measuring Quality of Parallel Job Schedules
Prediction of Queue Waiting Times for Metascheduling on Parallel Batch Systems
Dynamically Scheduling a Component-Based Framework in Clusters
How to Design a Job Scheduling Algorithm
Bubble Task:?A Dynamic Execution Throttling Method for Multi-core Resource Management
Real-World Clustering for Task Graphs on Shared Memory Systems
Experimental Analysis of the Tardiness of Parallel Tasks in Soft Real-time Systems
9.

電子ブック

EB
edited by Magnus Jonsson, Alexey Vinel, Boris Bellalta, Olav Tirkkonen
出版情報: Cham : Springer International Publishing : Imprint: Springer, 2015
シリーズ名: Lecture Notes in Computer Science ; 9305
オンライン: http://dx.doi.org/10.1007/978-3-319-23440-3
目次情報: 続きを見る
Wireless sensor networks
Physical layer techniques
Resources handling and allocation
Medium access control protocols and video coding
Wireless sensor networks
Physical layer techniques
Resources handling and allocation
10.

電子ブック

EB
edited by Ion Bica, David Naccache, Emil Simion
出版情報: Cham : Springer International Publishing : Imprint: Springer, 2015
シリーズ名: Lecture Notes in Computer Science ; 9522
オンライン: http://dx.doi.org/10.1007/978-3-319-27179-8
目次情報: 続きを見る
Authenticated-Encryption: Security Notions, Designs and Applications
New Results on Identity-based Encryption from Quadratic Residuosity
Efficient techniques for extracting secrets from electronic devices
Secure and Trusted Application Execution on Embedded Devices
A Number-Theoretic Error-Correcting Code
Full duplex OTP cryptosystem based on DNA key for text transmissions
Evaluation of Lightweight Block Ciphers for Embedded Systems
SCA Resistance Analysis on FPGA Implementations of Sponge based MAC-PHOTON
A Novel Fast and Secure Chaos-Based Algorithm for Image Encryption
A Novel Key Management for Virtually Limitless Key Size
Efficient Montgomery Multiplication on GPUs
Applying Cryptographic Acceleration Techniques to Error Correction
A Cooperative Black Hole Node Detection and Mitigation Approach for MANETs
Up-high to Down-low: Applying Machine Learning to an Exploit Database
Detecting Computers in the Cyber Space Maliciously Exploited as SSH Proxies
On a Lightweight Authentication Protocol for RFID
Spam Filtering using Automated Classifying Services Over a Cloud Computing Infrastructure
Contributions to Steganographic Techniques on Mobile Devices
Secure implementation of Stream cipher: Trivium
Fast Searching in Image Databases Using Multi-Hash Robust Fingerprinting
Authenticated-Encryption: Security Notions, Designs and Applications
New Results on Identity-based Encryption from Quadratic Residuosity
Efficient techniques for extracting secrets from electronic devices