Serwis Infona wykorzystuje pliki cookies (ciasteczka). Są to wartości tekstowe, zapamiętywane przez przeglądarkę na urządzeniu użytkownika. Nasz serwis ma dostęp do tych wartości oraz wykorzystuje je do zapamiętania danych dotyczących użytkownika, takich jak np. ustawienia (typu widok ekranu, wybór języka interfejsu), zapamiętanie zalogowania. Korzystanie z serwisu Infona oznacza zgodę na zapis informacji i ich wykorzystanie dla celów korzytania z serwisu. Więcej informacji można znaleźć w Polityce prywatności oraz Regulaminie serwisu. Zamknięcie tego okienka potwierdza zapoznanie się z informacją o plikach cookies, akceptację polityki prywatności i regulaminu oraz sposobu wykorzystywania plików cookies w serwisie. Możesz zmienić ustawienia obsługi cookies w swojej przeglądarce.
A new design paradigm — approximate computing — was established to investigate how computer systems can be made better — more energy efficient, faster, and less complex — by relaxing the requirement that they are exactly correct. The purpose of this paper is to introduce the principles of approximate computing and survey the research conducted in major subareas of approximate computing which are relevant...
Exact methods for Agglomerative Hierarchical Clustering (AHC) with average linkage do not scale well when the number of items to be clustered is large. The best known algorithms are characterized by quadratic complexity. This is a generally accepted fact and cannot be improved without using specifics of certain metric spaces. Twister tries is an algorithm that produces a dendrogram (i.e., Outcome...
A stable marriage problem (SMP) of size n involves n men and n women, each of whom has ordered members of the opposite gender by descending preferability. A solution is a perfect matching among men and women, such that there exists no pair who prefer each other to their current spouses. The problem was formulated in 1962 by Gale and Shapley, who showed that any instance can be solved in polynomial...
Clustering items using textual features is an important problem with many applications, such as root-cause analysis of spam campaigns, as well as identifying common topics in social media. Due to the sheer size of such data, algorithmic scalability becomes a major concern. In this work, we present our approach for text clustering that builds an approximate k-NN graph, which is then used to compute...
The algorithmic tasks of computing the Hamming distance between a given pattern P of length m and each location in a text T of length n is one of the most fundamental algorithmic tasks in string algorithms. Karloff [IPL 1999] showed that if one is willing to suffer a 1+ε approximation, then it is possible to solve the problem with high probability, in Õ(n/ε2) time. Due...
In this paper, we propose a variant of the iterative closet point (ICP) registration method by introducing a novel weight-bootstrap scheme. The rigid transform between two point sets can be estimated, as long as proper correspondences are given. The accuracy of the estimated transform is mainly determined by the goodness of these matches. However, the confidence of the correspondences is weakened...
The standard LP relaxation of the asymmetric traveling salesman problem has been conjectured to have a constant integrality gap in the metric case. We prove this conjecture when restricted to shortest path metrics of node-weighted digraphs. Our arguments are constructive and give a constant factor approximation algorithm for these metrics. We remark that the considered case is more general than the...
Evaluating influential nodes is one of the fundamental problems in large scale networks having wide range of applications. The centrality metric, in particular betweenness centrality plays a significant role in ranking influential nodes. Existing exact algorithms for evaluating betweenness centrality metric consider the entire network and hence incur high computational cost. In this paper, we reduce...
Recently, a framework for application-oriented optimal experiment design has been introduced. In this context, the distance of the estimated system from the true one is measured in terms of a particular end-performance metric. This treatment leads to superior unknown system estimates to classical experiment designs based on usual pointwise functional distances of the estimated system from the true...
In this paper, we examine data-driven aspects of consensus networks influenced by a stubborn agent. In particular we show that the judicious placement of the stubborn agent can be achieved based on snapshots of the data generated by the network through estimating the appropriate eigenvector of the perturbed Laplacian matrix. The exact dynamic mode decomposition algorithm is employed for estimating...
Most of the existing sparse recovery methods are based on the squared error criterion, i.e., ℓ2-norm metric, by appropriately adding to a sparsity-promoting regularizer. This criterion is, however, statistically optimal only when the noise are Gaussian distributed. In fact, non-Gaussian impulsive noise with heavy tailed distribution has been reported in a variety of practical applications. To guarantee...
This paper demonstrates that both Balanced Truncation and Balanced Singular Perturbation Approximations can be viewed as limiting approximations of the same parameterization of Linear Time Invariant (LTI) systems. First, we introduce a specific parameterization of LTI systems that distinguishes dynamic and structural parameters. Next, we apply the Model Boundary Approximation Method (MBAM) [1] to...
We introduce the problem of minimal actuator placement in a linear control system so that a bound on the minimum control effort for a given state transfer is satisfied while controllability is ensured. We first show that this is an NP-hard problem following the recent work of Olshevsky [1]. Next, we prove that this problem has a supermodular structure. Afterwards, we provide an efficient algorithm...
This paper presents a queueing network approach to the analysis and control of mobility-on-demand (MoD) systems for urban personal transportation. A MoD system consists of a fleet of vehicles providing one-way car sharing service and a team of drivers to rebalance such vehicles. The drivers then rebalance themselves by driving select customers similar to a taxi service. We model the MoD system as...
A novel approach for matching event sequences, that result from threshold-based sampling, is introduced. This approach relies on Hermann Weyl's discrepancy norm, which plays a central role in the context of stability analysis of threshold-based sampling. This metric is based on a maximal principle that evaluates intervals of maximal partial sums. It is shown that minimal length intervals of maximal...
Computing k-nearest-neighbor graphs constitutes a fundamental operation in a variety of data-mining applications. As a prominent example, user-based collaborative-filtering provides recommendations by identifying the items appreciated by the closest neighbors of a target user. As this kind of applications evolve, they will require KNN algorithms to operate on more and more sensitive data. This has...
We study the amount of randomness needed for an input process to approximate a given output distribution of a channel in the Eγ distance. A general one-shot achievability bound for the precision of such an approximation is developed. In the i.i.d. setting where γ = exp(nE), a (nonnegative) randomness rate above inf QU:D(Qx∥πx)≤E{D(QX∥πX) + (QX|U) − E} is necessary and sufficient to asymptotically...
In this article, we introduce a new metric called ‘information centric coverage probability’ to characterize the performance of a two-tier cache enabled cellular network. The proposed metric unifies the dynamics of in-network caching and heterogeneous networking to provide a unified performance measure. Specifically, it quantifies the probability that a mobile user (MU) is covered at a desired rate...
Real-world autonomous driving in city traffic must cope with dynamic environments including other agents with uncertain intentions. This poses a challenging decision-making problem, e.g., deciding when to perform a passing maneuver or how to safely merge into traffic. Previous work in the literature has typically approached the problem using ad-hoc solutions that do not consider the possible future...
We present Partial Quick Hull (PQH), an algorithm to efficiently compute one of the most commonly used grasp quality metrics. The metric relies on the computation of the convex hull of a set of points in a six dimensional space. Built on top of widely used QuickHull algorithm, PQH exploits the relationship between the convex hull and the grasp quality metric to avoid computing the whole convex hull...
Podaj zakres dat dla filtrowania wyświetlonych wyników. Możesz podać datę początkową, końcową lub obie daty. Daty możesz wpisać ręcznie lub wybrać za pomocą kalendarza.