close
1.

図書

図書
Lemay, Laura
出版情報: 東京 : プレンティスホール出版, 1995.6-12
所蔵情報: loading…
2.

電子ブック

EB
edited by Muhammad Younas, Irfan Awan, Massimo Mecella
出版情報: Cham : Springer International Publishing : Imprint: Springer, 2015
シリーズ名: Lecture Notes in Computer Science ; 9228
オンライン: http://dx.doi.org/10.1007/978-3-319-23144-0
目次情報: 続きを見る
Mobile services and applications
Usability and visualization
Mobile networks and applications
Mobile data services
Smart phones and mobile commerce applications
Mobile services and applications
Usability and visualization
Mobile networks and applications
3.

電子ブック

EB
edited by Yuhua Luo
出版情報: Cham : Springer International Publishing : Imprint: Springer, 2015
シリーズ名: Lecture Notes in Computer Science ; 9320
オンライン: http://dx.doi.org/10.1007/978-3-319-24132-6
目次情報: 続きを見る
Cooperative team work from psychological features: A Bayesian net-work approach
Extending CIAM methodology to support mobile application design and evaluation: a case study in m-Learning
SCPL: a Social Cooperative Programming Language to automate cooperative processes
Engineering Data Intensive Applications with Cadral
Dynamic Content/User Identification in Social Semantic Tagging Systems
Challenges of Big Data in the age of Building Information Modeling: A high-level conceptual pipeline
SMART: Design and Evaluation of a Collaborative Museum Visiting Application
The Design of Wall Pictures to Relieve the Fatigue of Driving in the Long Tunnel
Towards an Implementable Aesthetic Measure for Collaborative Architecture Design
Cooperative Monitoring of the delivery of Fresh Products
Evaluating a Micro-payment System for Collaborative Electronic Commence
A Cloud Model for Internet of Things on Logistic Supply Chain
A Collaborative Requirement Mining Framework to Support OEMs
An Information Integrated Method and Its Application of Virtual Fac-tory Using BIM
Global Stiffness and Well-Conditioned Workspace Optimization Analy-sis of 3UPU-UPU Robot Based on Pareto Front Theory
A Hadoop use case for engineering data
Crowdsourced Clustering of Computer Generated Floor Plans
Collective Intelligence Support Protocol: a systemic approach for col-laborative architectural design
Collaborative Shopping with the Crowd
G-Form: A New Approach to Regard Deep Web Form as Galaxy of Concepts
Helaba: Attracting Attention to a Design Rationale System
Cooperative operating control for stimulation of simultaneously cultivated bioprocesses
Application of the Sequence Diagrams in the Design of Distributed Control System
Cooperative engineering of agent-based process control algorithm
An on-line Model Verification System for Model-based Control Algorithms
Co-construction of meaning via a collaborative action research ap-roach
Sentiment analysis based on collaborative data for polish language
Inter-discipline Collaboration in Medical Teaching
Supporting environmental planning: Knowledge management through fuzzy cognitive mapping
Ranking of Collaborative Research Teams Based on Social Network Analysis and Bibliometrics
A Solution of Collaboration and Interoperability for Networked Enterprises
An Automatic Progress Tracking Process from Point Cloud for Industrial Plants Construction
An Integrated Approach for Progress Tracking in Liquefied Natural Gas Construction
A Min-cost with delay Scheduling Method for Large Scale Instance Intensive Tasks
Cooperative team work from psychological features: A Bayesian net-work approach
Extending CIAM methodology to support mobile application design and evaluation: a case study in m-Learning
SCPL: a Social Cooperative Programming Language to automate cooperative processes
4.

電子ブック

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

電子ブック

EB
edited by Michael Reiter, David Naccache
出版情報: Cham : Springer International Publishing : Imprint: Springer, 2015
シリーズ名: Lecture Notes in Computer Science ; 9476
オンライン: http://dx.doi.org/10.1007/978-3-319-26823-1
6.

電子ブック

EB
edited by Liqun Chen, Shin'ichiro Matsuo
出版情報: Cham : Springer International Publishing : Imprint: Springer, 2015
シリーズ名: Lecture Notes in Computer Science ; 9497
オンライン: http://dx.doi.org/10.1007/978-3-319-27152-1
7.

電子ブック

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

電子ブック

EB
edited by Yvo Desmedt
出版情報: Cham : Springer International Publishing : Imprint: Springer, 2015
シリーズ名: Lecture Notes in Computer Science ; 7807
オンライン: http://dx.doi.org/10.1007/978-3-319-27659-5
9.

電子ブック

EB
edited by Weizhong Qiang, Xianghan Zheng, Ching-Hsien Hsu
出版情報: Cham : Springer International Publishing : Imprint: Springer, 2015
シリーズ名: Lecture Notes in Computer Science ; 9106
オンライン: http://dx.doi.org/10.1007/978-3-319-28430-9
目次情報:
Cloud architecture
Applications
Big data and social networks; security and privacy
Cloud architecture
Applications
Big data and social networks; security and privacy
10.

電子ブック

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