2
2.0

Jun 30, 2018
06/18

by
Jean-Guillaume Dumas; Erich Kaltofen

texts

#
eye 2

#
favorite 0

#
comment 0

Certificates to a linear algebra computation are additional data structures for each output, which can be used by a---possibly randomized---verification algorithm that proves the correctness of each output. The certificates are essentially optimal if the time (and space) complexity of verification is essentially linear in the input size $N$, meaning $N$ times a factor $N^{o(1)}$, i.e., a factor $N^{\eta(N)}$ with $\lim_{N\to \infty} \eta(N)$ $=$ $0$. We give algorithms that compute essentially...

Topics: Symbolic Computation, Computing Research Repository

Source: http://arxiv.org/abs/1401.4567

2
2.0

Jun 29, 2018
06/18

by
Konstantinos Makantasis; Antonis Nikitakis; Anastasios Doulamis; Nikolaos Doulamis; Yannis Papaefstathiou

texts

#
eye 2

#
favorite 0

#
comment 0

Detection of moving objects in videos is a crucial step towards successful surveillance and monitoring applications. A key component for such tasks is usually called background subtraction and tries to extract regions of interest from the image background for further processing or action. For this reason, its accuracy and its real-time performance is of great significance. Although, effective background subtraction methods have been proposed, only a few of them take into consideration the...

Topics: Computer Vision and Pattern Recognition, Computing Research Repository

Source: http://arxiv.org/abs/1608.00229

2
2.0

Jun 30, 2018
06/18

by
Katarzyna Paluch

texts

#
eye 2

#
favorite 0

#
comment 0

In the maximum asymmetric traveling salesman problem (Max ATSP) we are given a complete directed graph with nonnegative weights on the edges and we wish to compute a traveling salesman tour of maximum weight. In this paper we give a fast combinatorial $\frac 34$-approximation algorithm for Max ATSP. It is based on a novel use of {\it half-edges}, matchings and a new method of edge coloring. (A {\it half-edge} of edge $(u,v)$ is informally speaking "either a head or a tail of...

Topics: Discrete Mathematics, Data Structures and Algorithms, Computing Research Repository

Source: http://arxiv.org/abs/1401.3670

4
4.0

Jun 29, 2018
06/18

by
Yu Wu; Wei Wu; Zhoujun Li; Ming Zhou

texts

#
eye 4

#
favorite 0

#
comment 0

We consider incorporating topic information into message-response matching to boost responses with rich content in retrieval-based chatbots. To this end, we propose a topic-aware convolutional neural tensor network (TACNTN). In TACNTN, matching between a message and a response is not only conducted between a message vector and a response vector generated by convolutional neural networks, but also leverages extra topic information encoded in two topic vectors. The two topic vectors are linear...

Topics: Computation and Language, Computing Research Repository

Source: http://arxiv.org/abs/1605.00090

3
3.0

Jun 30, 2018
06/18

by
Che-Yu Liu; Sébastien Bubeck

texts

#
eye 3

#
favorite 0

#
comment 0

We study the problem of finding the most mutually correlated arms among many arms. We show that adaptive arms sampling strategies can have significant advantages over the non-adaptive uniform sampling strategy. Our proposed algorithms rely on a novel correlation estimator. The use of this accurate estimator allows us to get improved results for a wide range of problem instances.

Topics: Machine Learning, Computing Research Repository, Statistics, Learning

Source: http://arxiv.org/abs/1404.5903

3
3.0

Jun 28, 2018
06/18

by
Emmanuel Jeandel

texts

#
eye 3

#
favorite 0

#
comment 0

We prove that every polycyclic group of nonlinear growth admits a strongly aperiodic SFT and has an undecidable domino problem. This answers a question of [4] and generalizes the result of [2].

Topics: Mathematics, Discrete Mathematics, Computing Research Repository, Group Theory

Source: http://arxiv.org/abs/1510.02360

2
2.0

Jun 29, 2018
06/18

by
Palash Dey

texts

#
eye 2

#
favorite 0

#
comment 0

The domain of single crossing preference profiles is a widely studied domain in social choice theory. It has been generalized to the domain of single crossing preference profiles with respect to trees which inherits many desirable properties from the single crossing domain, for example, transitivity of majority relation, existence of polynomial time algorithms for finding winners of Kemeny voting rule, etc. In this paper, we consider a further generalization of the domain of single crossing...

Topics: Artificial Intelligence, Data Structures and Algorithms, Computing Research Repository, Multiagent...

Source: http://arxiv.org/abs/1611.04175

4
4.0

Jun 29, 2018
06/18

by
Matthew Aldridge; Oliver Johnson; Jonathan Scarlett

texts

#
eye 4

#
favorite 0

#
comment 0

We consider nonadaptive group testing where each item is placed in a constant number of tests. The tests are chosen uniformly at random with replacement, so the testing matrix has (almost) constant column weights. We show that performance is improved compared to Bernoulli designs, where each item is placed in each test independently with a fixed probability. In particular, we show that the rate of the practical COMP detection algorithm is increased by 31% in all sparsity regimes. In dense...

Topics: Statistics Theory, Statistics, Information Theory, Computing Research Repository, Mathematics

Source: http://arxiv.org/abs/1602.03471

4
4.0

Jun 30, 2018
06/18

by
Volodymyr Kuleshov; Doina Precup

texts

#
eye 4

#
favorite 0

#
comment 0

Although many algorithms for the multi-armed bandit problem are well-understood theoretically, empirical confirmation of their effectiveness is generally scarce. This paper presents a thorough empirical study of the most popular multi-armed bandit algorithms. Three important observations can be made from our results. Firstly, simple heuristics such as epsilon-greedy and Boltzmann exploration outperform theoretically sound algorithms on most settings by a significant margin. Secondly, the...

Topics: Computing Research Repository, Artificial Intelligence, Learning

Source: http://arxiv.org/abs/1402.6028

3
3.0

Jun 30, 2018
06/18

by
Souvik Chandra; Dhagash Mehta; Aranya Chakrabortty

texts

#
eye 3

#
favorite 0

#
comment 0

The solution space of any set of power flow equations may contain different number of real-valued solutions. The boundaries that separate these regions are referred to as power flow solution space boundaries. Knowledge of these boundaries is important as they provide a measure for voltage stability. Traditionally, continuation based methods have been employed to compute these boundaries on the basis of initial guesses for the solution. However, with rapid growth of renewable energy sources...

Topics: Systems and Control, Algebraic Geometry, Computing Research Repository, Mathematics

Source: http://arxiv.org/abs/1704.04792

7
7.0

Jun 30, 2018
06/18

by
Hana Ajakan; Pascal Germain; Hugo Larochelle; François Laviolette; Mario Marchand

texts

#
eye 7

#
favorite 0

#
comment 0

We introduce a new representation learning algorithm suited to the context of domain adaptation, in which data at training and test time come from similar but different distributions. Our algorithm is directly inspired by theory on domain adaptation suggesting that, for effective domain transfer to be achieved, predictions must be made based on a data representation that cannot discriminate between the training (source) and test (target) domains. We propose a training objective that implements...

Topics: Machine Learning, Neural and Evolutionary Computing, Computing Research Repository, Statistics,...

Source: http://arxiv.org/abs/1412.4446

7
7.0

Jun 29, 2018
06/18

by
Fereshteh Asgari; Alexis Sultan; Haoyi Xiong; Vincent Gauthier; Mounim El-Yacoubi

texts

#
eye 7

#
favorite 0

#
comment 0

Mobile phone data have recently become an attractive source of information about mobility behavior. Since cell phone data can be captured in a passive way for a large user population, they can be harnessed to collect well-sampled mobility information. In this paper, we propose CT-Mapper, an unsupervised algorithm that enables the mapping of mobile phone traces over a multimodal transport network. One of the main strengths of CT-Mapper is its capability to map noisy sparse cellular multimodal...

Topics: Learning, Computing Research Repository, Social and Information Networks

Source: http://arxiv.org/abs/1604.06577

3
3.0

Jun 29, 2018
06/18

by
Arash Shahriari

texts

#
eye 3

#
favorite 0

#
comment 0

Pruning of redundant or irrelevant instances of data is a key to every successful solution for pattern recognition. In this paper, we present a novel ranking-selection framework for low-length but highly correlated instances. Instead of working in the low-dimensional instance space, we learn a supervised projection to high-dimensional space spanned by the number of classes in the dataset under study. Imposing higher distinctions via exposing the notion of labels to the instances, lets to deploy...

Topics: Machine Learning, Learning, Computer Vision and Pattern Recognition, Computing Research Repository,...

Source: http://arxiv.org/abs/1606.07575

4
4.0

Jun 30, 2018
06/18

by
Silas L. Fong; Vincent Y. F. Tan

texts

#
eye 4

#
favorite 0

#
comment 0

This paper establishes that the strong converse holds for some classes of discrete memoryless multimessage multicast networks (DM-MMNs) whose corresponding cut-set bounds are tight, i.e., coincide with the set of achievable rate tuples. The strong converse for these classes of DM-MMNs implies that all sequences of codes with rate tuples belonging to the exterior of the cut-set bound have average error probabilities that necessarily tend to one (and are not simply bounded away from zero)....

Topics: Mathematics, Computing Research Repository, Information Theory

Source: http://arxiv.org/abs/1407.2417

2
2.0

Jun 30, 2018
06/18

by
Tobias Gruber; Sebastian Cammerer; Jakob Hoydis; Stephan ten Brink

texts

#
eye 2

#
favorite 0

#
comment 0

We revisit the idea of using deep neural networks for one-shot decoding of random and structured codes, such as polar codes. Although it is possible to achieve maximum a posteriori (MAP) bit error rate (BER) performance for both code families and for short codeword lengths, we observe that (i) structured codes are easier to learn and (ii) the neural network is able to generalize to codewords that it has never seen during training for structured, but not for random codes. These results provide...

Topics: Information Theory, Computing Research Repository, Mathematics

Source: http://arxiv.org/abs/1701.07738

3
3.0

Jun 29, 2018
06/18

by
J. M. Landsberg; Mateusz Michałek

texts

#
eye 3

#
favorite 0

#
comment 0

Let M_n denote the matrix multiplication tensor for nxn matrices. We use the border substitution method combined with Koszul flattenings to prove the border rank lower bound of 2n^2-log(n)-1 for M_n.

Topics: Algebraic Geometry, Computational Complexity, Computing Research Repository, Mathematics

Source: http://arxiv.org/abs/1608.07486

4
4.0

Jun 29, 2018
06/18

by
Chanfei Wang; Tiejun Lv; Hui Gao; Shaoshi Yang

texts

#
eye 4

#
favorite 0

#
comment 0

Soft noncoherent detection, which relies on calculating the \textit{a posteriori} probabilities (APPs) of the bits transmitted with no channel estimation, is imperative for achieving excellent detection performance in high-dimensional wireless communications. In this paper, a high-performance belief propagation (BP)-based soft multiple-symbol differential detection (MSDD) framework, dubbed BP-MSDD, is proposed with its illustrative application in differential space-time block-code (DSTBC)-aided...

Topics: Information Theory, Computing Research Repository, Mathematics

Source: http://arxiv.org/abs/1608.01296

9
9.0

Jun 29, 2018
06/18

by
Junaid Qadir; Arjuna Sathiaseelan; Liang Wang; Jon Crowcroft

texts

#
eye 9

#
favorite 0

#
comment 0

Internet is the linchpin of modern society, which the various threads of modern life weave around. But being a part of the bigger energy-guzzling industrial economy, it is vulnerable to disruption. It is widely believed that our society is exhausting its vital resources to meet our energy requirements, and the cheap fossil fuel fiesta will soon abate as we cross the tipping point of global oil production. We will then enter the long arc of scarcity, constraints, and limits---a post-peak...

Topics: Networking and Internet Architecture, Computing Research Repository

Source: http://arxiv.org/abs/1602.08135

4
4.0

Jun 30, 2018
06/18

by
Luis Gerardo Mojica

texts

#
eye 4

#
favorite 0

#
comment 0

An-ever increasing number of social media websites, electronic newspapers and Internet forums allow visitors to leave comments for others to read and interact. This exchange is not free from participants with malicious intentions, which do not contribute with the written conversation. Among different communities users adopt strategies to handle such users. In this paper we present a comprehensive categorization of the trolling phenomena resource, inspired by politeness research and propose a...

Topics: Computing Research Repository, Computation and Language

Source: http://arxiv.org/abs/1704.02385

4
4.0

Jun 30, 2018
06/18

by
Ashwin Pananjady; Vivek Kumar Bagaria; Rahul Vaze

texts

#
eye 4

#
favorite 0

#
comment 0

Given a universe $U$ of $n$ elements and a collection of subsets $\mathcal{S}$ of $U$, the maximum disjoint set cover problem (DSCP) is to partition $\mathcal{S}$ into as many set covers as possible, where a set cover is defined as a collection of subsets whose union is $U$. We consider the online DSCP, in which the subsets arrive one by one (possibly in an order chosen by an adversary), and must be irrevocably assigned to some partition on arrival with the objective of minimizing the...

Topics: Networking and Internet Architecture, Data Structures and Algorithms, Computing Research Repository

Source: http://arxiv.org/abs/1411.5739

2
2.0

Jun 29, 2018
06/18

by
Israela Solomon

texts

#
eye 2

#
favorite 0

#
comment 0

We present a simple sublinear time algorithm for testing the following geometric property. Let $P_1, ..., P_n$ be $n$ convex sets in $\mathbb{R}^d$ ($n \gg d$), such as polytopes, balls, etc. We assume that the complexity of each set depends only on $d$ (and not on the number of sets $n$). We test the property that there exists a common point in all sets, i.e. that their intersection is nonempty. Our goal is to distinguish between the case where the intersection is nonempty, and the case where...

Topics: Data Structures and Algorithms, Computational Geometry, Computing Research Repository

Source: http://arxiv.org/abs/1612.03735

3
3.0

Jun 29, 2018
06/18

by
Mahdi Haghifam; Behrooz Makki; Masoumeh Nasiri-Kenari; Tommy Svensson

texts

#
eye 3

#
favorite 0

#
comment 0

This paper investigates the outage probability and the throughput of relay networks with wireless information and energy transfer where the relays harvest energy from the transmitted radio-frequency signal of the source. Considering different power consumption models, we derive the outage probability for both adaptive and non-adaptive power allocations at the relay. With a total energy consumption constraint at the source, we provide closed-form expressions for the optimal time sharing and...

Topics: Information Theory, Computing Research Repository, Mathematics

Source: http://arxiv.org/abs/1607.07087

2
2.0

Jun 28, 2018
06/18

by
Yukiko Yamauchi; Taichi Uehara; Masafumi Yamashita

texts

#
eye 2

#
favorite 0

#
comment 0

We consider a swarm of autonomous mobile robots each of which is an anonymous point in the three-dimensional Euclidean space (3D-space) and synchronously executes a common distributed algorithm. We investigate the pattern formation problem that requires the robots to form a given target pattern from an initial configuration and characterize the problem by showing a necessary and sufficient condition for the robots to form a given target pattern. The pattern formation problem in the two...

Topics: Computing Research Repository, Distributed, Parallel, and Cluster Computing

Source: http://arxiv.org/abs/1509.09207

4
4.0

Jun 30, 2018
06/18

by
Jiashi Feng; Huan Xu; Shie Mannor

texts

#
eye 4

#
favorite 0

#
comment 0

We propose a framework for distributed robust statistical learning on {\em big contaminated data}. The Distributed Robust Learning (DRL) framework can reduce the computational time of traditional robust learning methods by several orders of magnitude. We analyze the robustness property of DRL, showing that DRL not only preserves the robustness of the base robust learning method, but also tolerates contaminations on a constant fraction of results from computing nodes (node failures). More...

Topics: Machine Learning, Computing Research Repository, Statistics, Learning

Source: http://arxiv.org/abs/1409.5937

4
4.0

Jun 29, 2018
06/18

by
Jeaneth Machicao; Edilson A. Corrêa; Gisele H. B. Miranda; Diego R. Amancio; Odemir M. Bruno

texts

#
eye 4

#
favorite 0

#
comment 0

The authorship attribution is a problem of considerable practical and technical interest. Several methods have been designed to infer the authorship of disputed documents in multiple contexts. While traditional statistical methods based solely on word counts and related measurements have provided a simple, yet effective solution in particular cases; they are prone to manipulation. Recently, texts have been successfully modeled as networks, where words are represented by nodes linked according...

Topics: Computation and Language, Computing Research Repository

Source: http://arxiv.org/abs/1610.06498

2
2.0

Jun 29, 2018
06/18

by
Nikolaus Hansen; Anne Auger; Olaf Mersmann; Tea Tusar; Dimo Brockhoff

texts

#
eye 2

#
favorite 0

#
comment 0

COCO is a platform for Comparing Continuous Optimizers in a black-box setting. It aims at automatizing the tedious and repetitive task of benchmarking numerical optimization algorithms to the greatest possible extent. We present the rationals behind the development of the platform as a general proposition for a guideline towards better benchmarking. We detail underlying fundamental concepts of COCO such as its definition of a problem, the idea of instances, the relevance of target values, and...

Topics: Machine Learning, Artificial Intelligence, Numerical Analysis, Computing Research Repository,...

Source: http://arxiv.org/abs/1603.08785

5
5.0

Jun 30, 2018
06/18

by
Kai Kang; Hongsheng Li; Tong Xiao; Wanli Ouyang; Junjie Yan; Xihui Liu; Xiaogang Wang

texts

#
eye 5

#
favorite 0

#
comment 0

Object detection in videos has drawn increasing attention recently with the introduction of the large-scale ImageNet VID dataset. Different from object detection in static images, temporal information in videos is vital for object detection. To fully utilize temporal information, state-of-the-art methods are based on spatiotemporal tubelets, which are essentially sequences of associated bounding boxes across time. However, the existing methods have major limitations in generating tubelets in...

Topics: Computing Research Repository, Computer Vision and Pattern Recognition

Source: http://arxiv.org/abs/1702.06355

9
9.0

Jun 28, 2018
06/18

by
Nikolaos I. Miridakis; Dimitrios D. Vergados; Angelos Michalas

texts

#
eye 9

#
favorite 0

#
comment 0

The performance of an underlay cognitive (secondary) dual-hop relaying system with multiple antennas and hardware impairments at each transceiver is investigated. In particular, the outage probability of the end-to-end (e2e) communication is derived in closed-form, when either transmit antenna selection with maximum ratio combining (TAS/MRC), or TAS with selection combining (TAS/SC) are established in each hop. Simplified asymptotic outage expressions are also obtained, which manifest the...

Topics: Information Theory, Computing Research Repository, Mathematics

Source: http://arxiv.org/abs/1509.00166

4
4.0

Jun 28, 2018
06/18

by
Kent Tsz Kan Cheung; Shaoshi Yang; Lajos Hanzo

texts

#
eye 4

#
favorite 0

#
comment 0

The energy spectral efficiency maximization (ESEM) problem of a multi-user, multi-relay, multi-cell system is considered, where all the network nodes are equipped with multi-antenna transceivers. To deal with the potentially excessive interference originating from a plethora of geographically distributed transmission sources, a pair of transmission protocols based on interference alignment (IA) are conceived. The first, termed the full-IA, avoids all intra-cell interference (ICI) and other-cell...

Topics: Information Theory, Computing Research Repository, Mathematics

Source: http://arxiv.org/abs/1510.01385

2
2.0

Jun 30, 2018
06/18

by
Claudio Mazzola; Peter Evans

texts

#
eye 2

#
favorite 0

#
comment 0

The principle of common cause asserts that positive correlations between causally unrelated events ought to be explained through the action of some shared causal factors. Reichenbachian common cause systems are probabilistic structures aimed at accounting for cases where correlations of the aforesaid sort cannot be explained through the action of a single common cause. The existence of Reichenbachian common cause systems of arbitrary finite size for each pair of non-causally correlated events...

Topics: History and Philosophy of Physics, Physics, Computing Research Repository, Other Statistics,...

Source: http://arxiv.org/abs/1703.00352

3
3.0

Jun 28, 2018
06/18

by
Akrati Saxena; S. R. S. Iyengar

texts

#
eye 3

#
favorite 0

#
comment 0

Real world complex networks are scale free and possess meso-scale properties like core-periphery and community structure. We study evolution of the core over time in real world networks. This paper proposes evolving models for both unweighted and weighted scale free networks having local and global core-periphery as well as community structure. Network evolves using topological growth, self growth, and weight distribution function. To validate the correctness of proposed models, we use K-shell...

Topics: Physics and Society, Social and Information Networks, Computing Research Repository, Physics

Source: http://arxiv.org/abs/1511.08971

6
6.0

Jun 29, 2018
06/18

by
Marius Cordts; Mohamed Omran; Sebastian Ramos; Timo Rehfeld; Markus Enzweiler; Rodrigo Benenson; Uwe Franke; Stefan Roth; Bernt Schiele

texts

#
eye 6

#
favorite 0

#
comment 0

Visual understanding of complex urban street scenes is an enabling factor for a wide range of applications. Object detection has benefited enormously from large-scale datasets, especially in the context of deep learning. For semantic urban scene understanding, however, no current dataset adequately captures the complexity of real-world urban scenes. To address this, we introduce Cityscapes, a benchmark suite and large-scale dataset to train and test approaches for pixel-level and instance-level...

Topics: Computer Vision and Pattern Recognition, Computing Research Repository

Source: http://arxiv.org/abs/1604.01685

4
4.0

Jun 30, 2018
06/18

by
J Gerard Wolff

texts

#
eye 4

#
favorite 0

#
comment 0

These notes pose a "proof challenge": a proof, or disproof, of the proposition that "For any given body of information, I, expressed as a one-dimensional sequence of atomic symbols, a multiple alignment concept, described in the document, provides a means of encoding all the redundancy that may exist in I. Aspects of the challenge are described.

Topics: Computing Research Repository, Artificial Intelligence

Source: http://arxiv.org/abs/1403.1169

3
3.0

Jun 28, 2018
06/18

by
Yiqi Cai; Xiaohu Guo; Yang Liu; Wenping Wang; Weihua Mao; Zichun Zhong

texts

#
eye 3

#
favorite 0

#
comment 0

In this paper, we present a surface remeshing method with high approximation quality based on Principal Component Analysis. Given a triangular mesh and a user assigned polygon/vertex budget, traditional methods usually require the extra curvature metric field for the desired anisotropy to best approximate the surface, even though the estimated curvature metric is known to be imperfect and already self-contained in the surface. In our approach, this anisotropic control is achieved through the...

Topics: Graphics, Computing Research Repository

Source: http://arxiv.org/abs/1510.03935

3
3.0

Jun 30, 2018
06/18

by
István Pelle; Felicián Németh; András Gulyás

texts

#
eye 3

#
favorite 0

#
comment 0

An ideal network troubleshooting system would be an almost fully automated system, monitoring the whole network at once, feeding the results to a knowledge-based decision making system that suggests actions to the operator or corrects the failure automatically. Reality is quite the contrary: operators separated in their offices try to track down complex networking failures in their own way, which is generally a long sequence of manually edited parallel shell commands (mostly ping, traceroute,...

Topics: Networking and Internet Architecture, Computing Research Repository

Source: http://arxiv.org/abs/1702.08827

2
2.0

Jun 30, 2018
06/18

by
Tomer Kotek; Mantas Simkus; Helmut Veith; Florian Zuleger

texts

#
eye 2

#
favorite 0

#
comment 0

We introduce a description logic ALCQIO_{b,Re} which adds reachability assertions to ALCQIO, a sub-logic of the two-variable fragment of first order logic with counting quantifiers. ALCQIO_{b,Re} is well-suited for applications in software verification and shape analysis. Shape analysis requires expressive logics which can express reachability and have good computational properties. We show that ALCQIO_{b,Re} can describe complex data structures with a high degree of sharing and allows...

Topics: Logic in Computer Science, Computing Research Repository

Source: http://arxiv.org/abs/1402.6804

3
3.0

Jun 30, 2018
06/18

by
Richard A. Blythe; Andrew D. M. Smith; Kenny Smith

texts

#
eye 3

#
favorite 0

#
comment 0

Language learners must learn the meanings of many thousands of words, despite those words occurring in complex environments in which infinitely many meanings might be inferred by the learner as a word's true meaning. This problem of infinite referential uncertainty is often attributed to Willard Van Orman Quine. We provide a mathematical formalisation of an ideal cross-situational learner attempting to learn under infinite referential uncertainty, and identify conditions under which word...

Topics: Physics, Physics and Society, Computation and Language, Computing Research Repository

Source: http://arxiv.org/abs/1412.2487

4
4.0

Jun 30, 2018
06/18

by
Scott A. Skirlo; Ling Lu; Marin Soljačić

texts

#
eye 4

#
favorite 0

#
comment 0

We define a new class of binary matrices by maximizing the peak-sidelobe distances in the aperiodic autocorrelations. These matrices can be used as robust position marks for in-plane spatial alignment. The optimal square matrices of dimensions up to 7 by 7 and optimal diagonally-symmetric matrices of 8 by 8 and 9 by 9 were found by exhaustive searches.

Topics: Mathematics, Computing Research Repository, Computer Vision and Pattern Recognition, Information...

Source: http://arxiv.org/abs/1408.6915

5
5.0

Jun 28, 2018
06/18

by
Anindya Gupta; B. Sundar Rajan

texts

#
eye 5

#
favorite 0

#
comment 0

While feasibility and obtaining a solution of a given network coding problem are well studied, the decoding procedure and complexity have not garnered much attention. We consider the decoding problem in a network wherein the sources generate multiple messages and the sink nodes demand some or all of the source messages. We consider both linear and non-linear network codes over a finite field and propose to use the sum-product (SP) algorithm over Boolean semiring for decoding at the sink nodes...

Topics: Information Theory, Computing Research Repository, Mathematics

Source: http://arxiv.org/abs/1510.03634

6
6.0

Jun 30, 2018
06/18

by
David Mateos-Núñez; María A. González-Huici; Renato Simoni; Stefan Brüggenwirth

texts

#
eye 6

#
favorite 0

#
comment 0

We present adaptive strategies for antenna selection for Direction of Arrival (DoA) estimation of a far-field source using TDM MIMO radar with linear arrays. Our treatment is formulated within a general adaptive sensing framework that uses one-step ahead predictions of the Bayesian MSE using a parametric family of Weiss-Weinstein bounds that depend on previous measurements. We compare in simulations our strategy with adaptive policies that optimize the Bobrovsky- Zaka{\i} bound and the Expected...

Topics: Systems and Control, Computing Research Repository

Source: http://arxiv.org/abs/1704.03345

3
3.0

Jun 30, 2018
06/18

by
Min Ye; Alexander Barg

texts

#
eye 3

#
favorite 0

#
comment 0

We show that polar codes can be used to achieve the rate-distortion functions in the problem of hierarchical source coding also known as the successive refinement problem. We also analyze the distributed version of this problem, constructing a polar coding scheme that achieves the rate distortion functions for successive refinement with side information.

Topics: Mathematics, Computing Research Repository, Information Theory

Source: http://arxiv.org/abs/1404.5501

3
3.0

Jun 28, 2018
06/18

by
Khadija Tijani; Ayesha Kashif; Stéphane Ploix; Benjamin Haas; Julie Dugdale

texts

#
eye 3

#
favorite 0

#
comment 0

This paper analyzes two modeling approaches for occupant behaviour in buildings. It compares a purely statistical approach with a multi-agent social simulation based approach. The study concerns the door openings in an office.

Topics: Multiagent Systems, Computing Research Repository

Source: http://arxiv.org/abs/1510.02225

4
4.0

Jun 30, 2018
06/18

by
Masaaki Nagahara; Clyde F. Martin

texts

#
eye 4

#
favorite 0

#
comment 0

In this paper, we propose control theoretic smoothing splines with L1 optimality for reducing the number of parameters that describes the fitted curve as well as removing outlier data. A control theoretic spline is a smoothing spline that is generated as an output of a given linear dynamical system. Conventional design requires exactly the same number of base functions as given data, and the result is not robust against outliers. To solve these problems, we propose to use L1 optimality, that...

Topics: Computation, Statistics, Mathematics, Computing Research Repository, Information Theory, Systems...

Source: http://arxiv.org/abs/1407.1697

3
3.0

Jun 29, 2018
06/18

by
Jayashree HV; Himanshu Thapliyal; Hamid R. Arabnia; V K Agrawal

texts

#
eye 3

#
favorite 0

#
comment 0

A reversible logic has application in quantum computing. A reversible logic design needs resources such as ancilla and garbage qubits to reconfigure circuit functions or gate functions. The removal of garbage qubits and ancilla qubits are essential in designing an efficient quantum circuit. In the literature, there are multiple designs that have been proposed for a reversible multiplication operation. A multiplication hardware is essential for the circuit design of quantum algorithms, quantum...

Topics: Emerging Technologies, Quantum Physics, Computing Research Repository

Source: http://arxiv.org/abs/1608.01228

5
5.0

Jun 29, 2018
06/18

by
Birenjith Sasidharan; Myna Vajha; P. Vijay Kumar

texts

#
eye 5

#
favorite 0

#
comment 0

This paper presents an explicit construction for an $((n,k,d=n-1), (\alpha,\beta))$ regenerating code over a field $\mathbb{F}_Q$ operating at the Minimum Storage Regeneration (MSR) point. The MSR code can be constructed to have rate $k/n$ as close to $1$ as desired, sub-packetization given by $r^{\frac{n}{r}}$, for $r=(n-k)$, field size no larger than $n$ and where all code symbols can be repaired with the same minimum data download. The construction modifies a prior construction by Sasidharan...

Topics: Information Theory, Computing Research Repository, Mathematics

Source: http://arxiv.org/abs/1607.07335

3
3.0

Jun 29, 2018
06/18

by
Dinh Hoa Nguyen; Tatsuo Narikiyo; Michihiro Kawanishi

texts

#
eye 3

#
favorite 0

#
comment 0

This paper proposes a new approach to analyze and design distributed robust consensus control protocols for general linear leaderless multi-agent systems (MASs) in presence of relative-state constraints or uncertainties. First, we show that the MAS robust consensus under relative-state constraints or uncertainties is equivalent to the robust stability under state constraints or uncertainties of a transformed MAS. Next, the transformed MAS under state constraints or uncertainties is reformulated...

Topics: Optimization and Control, Systems and Control, Computing Research Repository, Mathematics

Source: http://arxiv.org/abs/1605.03647

6
6.0

Jun 30, 2018
06/18

by
Tarek Sakakini; Suma Bhat; Pramod Viswanath

texts

#
eye 6

#
favorite 0

#
comment 0

We present an unsupervised and language-agnostic method for learning root-and-pattern morphology in Semitic languages. This form of morphology, abundant in Semitic languages, has not been handled in prior unsupervised approaches. We harness the syntactico-semantic information in distributed word representations to solve the long standing problem of root-and-pattern discovery in Semitic languages. Moreover, we construct an unsupervised root extractor based on the learned rules. We prove the...

Topics: Computing Research Repository, Computation and Language

Source: http://arxiv.org/abs/1702.02211

4
4.0

Jun 29, 2018
06/18

by
Nicolas Loizou

texts

#
eye 4

#
favorite 0

#
comment 0

We present a new model of incomplete information games without private information in which the players use a distributionally robust optimization approach to cope with the payoff uncertainty. With some specific restrictions, we show that our "Distributionally Robust Game" constitutes a true generalization of three popular finite games. These are the Complete Information Games, Bayesian Games and Robust Games. Subsequently, we prove that the set of equilibria of an arbitrary...

Topics: Computing Research Repository, Computer Science and Game Theory

Source: http://arxiv.org/abs/1610.00651

2
2.0

Jun 30, 2018
06/18

by
Vivek Shah

texts

#
eye 2

#
favorite 0

#
comment 0

The growth in variety and volume of OLTP (Online Transaction Processing) applications poses a challenge to OLTP systems to meet performance and cost demands in the existing hardware landscape. These applications are highly interactive (latency sensitive) and require update consistency. They target commodity hardware for deployment and demand scalability in throughput with increasing clients and data. Currently, OLTP systems used by these applications provide trade-offs in performance and ease...

Topics: Databases, Computing Research Repository

Source: http://arxiv.org/abs/1701.04339

6
6.0

Jun 29, 2018
06/18

by
Rui Liu; Hossein Nejati; Ngai-Man Cheung

texts

#
eye 6

#
favorite 0

#
comment 0

We propose an algorithm to uncover the intrinsic low-rank component of a high-dimensional, graph-smooth and grossly-corrupted dataset, under the situations that the underlying graph is unknown. Based on a model with a low-rank component plus a sparse perturbation, and an initial graph estimation, our proposed algorithm simultaneously learns the low-rank component and refines the graph. Our evaluations using synthetic and real brain imaging data in unsupervised and supervised classification...

Topics: Computer Vision and Pattern Recognition, Computing Research Repository, Learning

Source: http://arxiv.org/abs/1609.08221