close
1.

電子ブック

EB
edited by Annalisa Appice, Pedro Pereira Rodrigues, Vitor Santos Costa, Joao Gama, Alipio Jorge, Carlos Soares
出版情報: Cham : Springer International Publishing : Imprint: Springer, 2015
シリーズ名: Lecture Notes in Computer Science ; 9285
オンライン: http://dx.doi.org/10.1007/978-3-319-23525-7
2.

電子ブック

EB
edited by Grainne Conole, Toma? Klobu?ar, Christoph Rensing, Johannes Konert, Elise Lavoue
出版情報: Cham : Springer International Publishing : Imprint: Springer, 2015
シリーズ名: Lecture Notes in Computer Science ; 9307
オンライン: http://dx.doi.org/10.1007/978-3-319-24258-3
目次情報: 続きを見る
Blended learning
Self-regulated and self directed learning
Reflective learning
Intelligent learning systems
Learning communities
Learning design
Learning analytics
Learning assessment
Personalization and adaptation
Serious games
Social media
Massive open online courses (MOOCs)
Schools of the future
Blended learning
Self-regulated and self directed learning
Reflective learning
3.

電子ブック

EB
edited by Nathalie Japkowicz, Stan Matwin
出版情報: Cham : Springer International Publishing : Imprint: Springer, 2015
シリーズ名: Lecture Notes in Computer Science ; 9356
オンライン: http://dx.doi.org/10.1007/978-3-319-24282-8
目次情報: 続きを見る
Bilinear Prediction using Low Rank Models
Finding Hidden Structure in Data with Tensor Decompositions
Turning Prediction Tools Into Decision Tools
Overcoming obstacles to the adoption of machine learning by domain Experts
Resolution transfer in cancer classification based on amplification patterns
Very Short-Term Wind Speed Forecasting using Spatio-Temporal Lazy Learning
Discovery of Parameters for Animation of Midge Swarms
No Sentiment is an Island: Author's activity and sentiments transactions in sentiment classification
Active Learning for Classifying Template Matches in Historical Maps
An evaluation of score descriptors combined with non-linear models of expressive dynamics in music
Geo-Coordinated Parallel Coordinates (GCPC): A Case Study of Environmental Data Analysis
Generalized Shortest Path Kernel on Graphs
Ensembles of extremely randomized trees for multi-target regression
Clustering-Based Optimised Probabilistic Active Learning (COPAL)
Predictive Analysis on Tracking Emails for Targeted Marketing
Semi-supervised Learning for Stream Recommender Systems
Detecting Transmembrane Proteins Using Decision Trees
Change point detection for information diffusion tree
Multi-label Classification via Multi-target Regression on Data Streams
Periodical Skeletonization for Partially Periodic Pattern Mining
Predicting Drugs Adverse Side-Effects using a recommender-system
Dr. Inventor Framework: extracting structured information from scientific publications
Predicting Protein Function and Protein-Ligand Interaction with the 3D Neighborhood Kernel
Hierarchical Multidimensional Classification of web documents with MultiWebClass
Evaluating the Effectiveness of Hashtags as Predictors of the Sentiment of Tweets
On the Feasibility of Discovering Meta-Patterns from a Data Ensemble
An Algorithm for Influence Maximization in a Two-Terminal Series
Parallel Graph and Its Application to a Real Network
Benchmarking Stream Clustering for Churn Detection in Dynamic Networks
Canonical Correlation Methods for Exploring Microbe-Environment Interactions in Deep Subsurface
KeCo: Kernel-based Online Co-agreement Algorithm
Tree PCA for Extracting Dominant Substructures from Labeled Rooted Trees
Enumerating Maximal Clique Sets with Pseudo-Clique Constraint
Bilinear Prediction using Low Rank Models
Finding Hidden Structure in Data with Tensor Decompositions
Turning Prediction Tools Into Decision Tools
4.

電子ブック

EB
edited by Florian Daniel, Oscar Diaz
出版情報: Cham : Springer International Publishing : Imprint: Springer, 2015
シリーズ名: Lecture Notes in Computer Science ; 9396
オンライン: http://dx.doi.org/10.1007/978-3-319-24800-4
目次情報:
Natural Language Processing for Informal Text
Pervase WEb Technologies
Mining the Social Web
Natural Language Processing for Informal Text
Pervase WEb Technologies
Mining the Social Web
5.

電子ブック

EB
edited by Qin Lu, Helena Hong Gao
出版情報: Cham : Springer International Publishing : Imprint: Springer, 2015
シリーズ名: Lecture Notes in Computer Science ; 9332
オンライン: http://dx.doi.org/10.1007/978-3-319-27194-1
目次情報: 続きを見る
Lexical semantics
Lexical resources
Lexicology
Natural language processing and applications
Syntax
Lexical semantics
Lexical resources
Lexicology
6.

電子ブック

EB
edited by Tie-Yan Liu, Christie Napa Scollon, Wenwu Zhu
出版情報: Cham : Springer International Publishing : Imprint: Springer, 2015
シリーズ名: Lecture Notes in Computer Science ; 9471
オンライン: http://dx.doi.org/10.1007/978-3-319-27433-1
7.

電子ブック

EB
edited by Abdelkader Hameurlain, Josef Kung, Roland Wagner, Hendrik Decker, Lenka Lhotska, Sebastian Link
出版情報: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2015
シリーズ名: Lecture Notes in Computer Science ; 8980
オンライン: http://dx.doi.org/10.1007/978-3-662-46485-4
目次情報: 続きを見る
Using Argumentation to Structure E-Participation in Policy Making
Horizontal Business Process Model Integration
Exact and Approximate Generic Multi-criteria Top-k Query Processing
Continuous Predictive Line Queries for On-the-Go Traffic Estimation
Query Operators for Comparing Uncertain Graphs
Fast Disjoint and Overlapping Community Detection
A Hybrid Approach Using Genetic Programming and Greedy Search for QoS-Aware Web Service Composition
Using Argumentation to Structure E-Participation in Policy Making
Horizontal Business Process Model Integration
Exact and Approximate Generic Multi-criteria Top-k Query Processing
8.

電子ブック

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
9.

電子ブック

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
10.

電子ブック

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