The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
The paper presents design and implementation issues of a natural gesture user interface for real-time hand gesture recognition in depth data collected by a Kinect sensor. The hands are first segmented based on depth and a novel algorithm improves the scanning time in order to identify the first pixel on the hand contour within this space. Starting from this pixel, a directional search algorithm allows...
This paper considers the problem of controlling the complexity of the state space abstraction of a deterministic switched affine system, which must satisfy a rich specification, expressed as an Linear Temporal Logic (LTL) formula. We propose a probabilistic approach to the state space abstraction problem that enables a trade-off between complexity and accuracy of the abstraction. Instead of a deterministic...
The CFG recognition problem is: given a context-free grammar G and a string w of length n, decide if w can be obtained from G. This is the most basic parsing question and is a core computer science problem. Valiant's parser from 1975 solves the problem in O(nO) time, where ? < 2:373 is the matrix multiplication exponent. Dozens of parsing algorithms have been proposed over the years, yet Valiant's...
In this paper heuristics are proposed for finding the shortest loopless path, from a source node to a target node, that visits a given set of nodes in a directed graph, such that it can be protected using a node-disjoint path. This type of problem may arise due to network management constraints. The problem of calculating the shortest path that visits a given set of nodes is at least as difficult...
We present an algorithm for sparse Hamiltonian simulation whose complexity is optimal (up to log factors) as a function of all parameters of interest. Previous algorithms had optimal or near-optimal scaling in some parameters at the cost of poor scaling in others. Hamiltonian simulation via a quantum walk has optimal dependence on the sparsity at the expense of poor scaling in the allowed error. In...
Two important similarity measures between sequences are the longest common subsequence (LCS) and the dynamic time warping distance (DTWD). The computations of these measures for two given sequences are central tasks in a variety of applications. Simple dynamic programming algorithms solve these tasks in O(n2) time, and despite an extensive amount of research, no algorithms with significantly better...
The dynamic optimality conjecture is perhaps the most fundamental open question about binary search trees (BST). It postulates the existence of an asymptotically optimal online BST, i.e. One that is constant factor competitive with any BST on any input access sequence. The two main candidates for dynamic optimality in the literature are splay trees [Sleator and Tarjan, 1985], and Greedy [Lucas, 1988,...
The modern trend of extensive levels of hardware parallelism and heterogeneity pushes software to evolve through a paradigm shift towards concurrent data processing architectures. One such striking example in the domain of high-energy physics is represented by Gaudi — an experiment independent software framework, used in two of four major experiments of the Large Hadron Collider project, and in several...
Global alignment of two protein-protein interaction networks is an essentially important task in bioinformatics/computational biology field of study. It is a challenging and widely studied research topic in recent years. Accurately aligned networks allow us to identify functional modules of proteins and/or orthologous proteins from which unknown functions of a protein can be inferred. We here introduce...
In this study several algorithms for the generation of inexpensive and fault-tolerant graphs are evaluated with respect to the quality of the found graphs and to the runtime requirements. A special focus lies on the properties of the algorithm that basically is a simulation of the foraging of the slime mold Physarum polycephalum, since in many other works the deployment of this algorithm does not...
In homology search, finding optimal multiple spaced seeds in genomic DNA sequences is NP-hard but even finding good ones is very difficult. The exponential-time algorithm PatternHunter use optimal spaced seeds to increase both the sensitivity and the speed of homology search. The overlap complexity measure based on the overlaps between hits of a multiple seed are well correlated with sensitivity but...
In this paper we consider the pair-wise sequence alignment problem with gaps, which is motivated by the re-sequencing problem that requires to assemble short reads sequences into a genome sequence by referring to a reference sequence. The problem has been studied before for single gap and bounded number of gaps. For single gap, there was a GPU-based algorithm proposed. In our work we propose a GPU-based...
Methods for clustering static graphs cannot always be transferred straight forward to dynamic scenarios. A typical approach is to reduce the number of updates by reusing results of previous iterations. But are there natural ways to implement dynamic graph clustering? This paper proposes a method, which was derived by graph based ant colony algorithms. Similar to other clustering algorithms, multiple...
Generalized distributed mutual exclusion algorithms allow processes to concurrently access a set of shared resources. However, they must ensure an exclusive access to each resource. In order to avoid deadlocks, many of them are based on the strong assumption of a prior knowledge about conflicts between processes' requests. Some other approaches, which do not require such a knowledge, exploit broadcast...
The continuous Skyline query has recently become the subject of the several researches due to its wide spectrum of applications such as multi-criteria decision making, graph analysis network, wireless sensor network and data exploration. In these applications, the datasets are huge and have various dimensions. Moreover, they constantly change as time passes. Therefore, this query is considered as...
Voltage regulation is critical for distribution systems, and has become a much more challenging problem with the increasing proliferation of distributed renewable energy resources that cause frequent and rapid voltage fluctuations beyond what can be handled by the traditional voltage regulation methods. In this paper, motivated by the shortcomings of two previously proposed inverter-based local volt/var...
We consider the problem of scheduling VMs (Virtual Machines) in a multi-server system motivated by cloud computing applications. VMs arrive dynamically over time and require various amounts of resources (e.g., CPU, Memory, Storage, etc.) for the duration of their service. When a VM arrives, it is queued and later served by one of the servers that has sufficient remaining capacity to serve it. The...
IaaS is one of the three major cloud computing service models. Due to the dynamic arrival and departure of VM instances in IaaS, computing resource fragments cannot be avoided by traditional placement algorithms such as FFD and BF. In this paper, therefore, we propose a novel VM replacement algorithm called MCARD (Migration Cost-Aware Resource Defragmenter) to solve the problem that how to maximize...
Heterogeneous and small cell networks (HetSNets) have emerged as a promising mean to significantly improve coverage and performance of next generation cellular networks. However, the high density of base stations in such networks accentuates the harmful impact of interference on network performance. This paper considers a network of multiple small cells where the base stations seek to maximize a common...
Coordinated multi-point(CoMP) transmission clustering schemes could provide significant gains of system performance, such as throughput and cell- edge user data rates. Due to limitations of the backhaul communication and signal processing capability of base stations(BSs), the intrinsic problem of CoMP is that the selection of which BSs shall cooperate as only a few of BSs can be grouped in a cluster...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.