Keyword: computers: data-structure

Found 97 papers in total
Towards efficient and practical network coding in delay tolerant networks
Towards efficient and practical network coding in delay tolerant networks
2012,
Network coding techniques offer an emerging solution to efficient data transmission in...
Computational complexity and applications of quantum algorithm
Computational complexity and applications of quantum algorithm
2012,
We have studied on quantum algorithm several years, and introduced a mathematical...
Interoperable executive library for the simulation of biomedical processes
Interoperable executive library for the simulation of biomedical processes
2014,
We present an Interoperable Executive Library (IEL) built to run, in parallel, a...
Electrostatics simulations on the cloud with NCLab
Electrostatics simulations on the cloud with NCLab
2014,
This survey paper describes NCLab (Network Computing Laboratory), a novel cloud...
Role of acquisition intervals in private and public cloud storage costs
Role of acquisition intervals in private and public cloud storage costs
2014,
The paper introduces an analytical model for private and public storage costs. We...
Assessing the quality of large-scale data standards: A case of XBRL GAAP Taxonomy
Assessing the quality of large-scale data standards: A case of XBRL GAAP Taxonomy
2014,
A framework and a set of metrics for assessing the quality large‐scale data...
Sublinear Algorithms for Approximating String Compressibility
Sublinear Algorithms for Approximating String Compressibility
2013,
We raise the question of approximating the compressibility of a string with respect to...
Approximate Shortest Paths Avoiding a Failed Vertex: Near Optimal Data Structures for Undirected Unweighted Graphs
Approximate Shortest Paths Avoiding a Failed Vertex: Near Optimal Data Structures for Undirected Unweighted Graphs
2013,
Let G =( V , E ) be an undirected unweighted graph. A path between any two vertices u...
Optimal Tracking of Distributed Heavy Hitters and Quantiles
Optimal Tracking of Distributed Heavy Hitters and Quantiles
2013,
We consider the problem of tracking heavy hitters and quantiles in the distributed...
Approximately Uniform Online Checkpointing with Bounded Memory
Approximately Uniform Online Checkpointing with Bounded Memory
2013,
In many complex computational processes one may want to store a sample of the...
Compressed Directed Acyclic Word Graph with Application in Local Alignment
Compressed Directed Acyclic Word Graph with Application in Local Alignment
2013,
Suffix tree, suffix array, and directed acyclic word graph (DAWG) are...
Two-stage Robust Network Design with Exponential Scenarios
Two-stage Robust Network Design with Exponential Scenarios
2013,
We study two‐stage robust variants of combinatorial optimization problems on...
Streaming Graph Computations with a Helpful Advisor
Streaming Graph Computations with a Helpful Advisor
2013,
Motivated by the trend to outsource work to commercial cloud computing services, we...
Real‐time integrated prefetching and caching
Real‐time integrated prefetching and caching
2013,
The high latencies for access to background memory like hard disks or flash memory can...
Supports for transparent object‐migration in PDES systems ☆
Supports for transparent object‐migration in PDES systems ☆
2012,
It is well known that Parallel Discrete Event Simulation systems may suffer, in terms...
Research Note–To Continue Sharing or Not to Continue Sharing? An Empirical Analysis of User Decision in Peer‐to‐Peer Sharing Networks
Research Note–To Continue Sharing or Not to Continue Sharing? An Empirical Analysis of User Decision in Peer‐to‐Peer Sharing Networks
2012,
Peer‐to‐peer sharing networks have seen explosive growth recently. In...
Testing and Spot‐Checking of Data Streams
Testing and Spot‐Checking of Data Streams
2002,
We consider the tasks of testing and spot‐checking for data streams . These...
On Space Efficient Two Dimensional Range Minimum Data Structures
On Space Efficient Two Dimensional Range Minimum Data Structures
2012,
The two dimensional range minimum query problem is to preprocess a static m by n...
A Generalization of a Lower Bound Technique due to Fredman and Saks
A Generalization of a Lower Bound Technique due to Fredman and Saks
2001,
In a seminal paper of 1989, Fredman and Saks proved lower bounds for some important...
Efficient Regular Data Structures and Algorithms for Dilation, Location, and Proximity Problems
Efficient Regular Data Structures and Algorithms for Dilation, Location, and Proximity Problems
2001,
In this paper we investigate data structures obtained by a recursive partitioning of...
Communication–Processor Tradeoffs in a Limited Resources PRAM
Communication–Processor Tradeoffs in a Limited Resources PRAM
2002,
We consider a simple restriction of the PRAM model (called PPRAM), where the input is...
The Roles of Worker Expertise, Information Sharing Quality, and Psychological Safety in Manufacturing Process Innovation: An Intellectual Capital Perspective
The Roles of Worker Expertise, Information Sharing Quality, and Psychological Safety in Manufacturing Process Innovation: An Intellectual Capital Perspective
2011,
This paper examines the roles of three elements of intellectual capital in...
Significance evaluation technique for error conditions in data processing within enterprise automatic control system
Significance evaluation technique for error conditions in data processing within enterprise automatic control system
2011,
A problem of increasing the efficiency of automatic control system (ACS) in the field...
Analysis of keyword networks in MIS research and implications for predicting knowledge evolution
Analysis of keyword networks in MIS research and implications for predicting knowledge evolution
2011,
New concepts and ideas build on older ones. This path dependence in knowledge...
Papers per page: