7
7.0

Apr 27, 2017
04/17

Apr 27, 2017
by
Stefano Beretta; Mauro Castelli; Ivo Goncalves; Daniele Ramazzotti

texts

######
eye 7

######
favorite 0

######
comment 0

One of the most challenging tasks when adopting Bayesian Networks (BNs) is the one of learning their structure from data. This task is complicated by the huge search space of possible solutions and turned out to be a well-known NP-hard problem and, hence, approximations are required. However, to the best of our knowledge, a quantitative analysis of the performance and characteristics of the different heuristics to solve this problem has never been done before. For this reason, in this work, we...

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

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

6
6.0

Apr 27, 2017
04/17

Apr 27, 2017
by
Saba Asaad; Ali Bereyhi; Ralf R. Müller; Amir M. Rabiei

texts

######
eye 6

######
favorite 0

######
comment 0

Consider a fading Gaussian MIMO channel with $N_\mathrm{t}$ transmit and $N_\mathrm{r}$ receive antennas. The transmitter selects $L_\mathrm{t}$ antennas corresponding to the strongest channels. For this setup, we study the distribution of the input-output mutual information when $N_\mathrm{t}$ grows large. We show that, for any $N_\mathrm{r}$ and $L_\mathrm{t}$, the distribution of the input-output mutual information is accurately approximated by a Gaussian distribution whose mean grows large...

Topics: Information Theory, Computing Research Repository, Mathematics

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

3
3.0

Apr 27, 2017
04/17

Apr 27, 2017
by
Michael Elkin; Ofer Neiman

texts

######
eye 3

######
favorite 0

######
comment 0

For a positive parameter $\beta$, the $\beta$-bounded distance between a pair of vertices $u,v$ in a weighted undirected graph $G = (V,E,\omega)$ is the length of the shortest $u-v$ path in $G$ with at most $\beta$ edges, aka {\em hops}. For $\beta$ as above and $\epsilon>0$, a {\em $(\beta,\epsilon)$-hopset} of $G = (V,E,\omega)$ is a graph $G' =(V,H,\omega_H)$ on the same vertex set, such that all distances in $G$ are $(1+\epsilon)$-approximated by $\beta$-bounded distances in $G\cup G'$....

Topics: Data Structures and Algorithms, Computing Research Repository

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

2
2.0

Apr 27, 2017
04/17

Apr 27, 2017
by
Jocelyne Elias; Bartłomiej Błaszczyszyn

texts

######
eye 2

######
favorite 0

######
comment 0

We state and solve a problem of the optimal geographic caching of content in cellular networks, where linear combinations of contents are stored in the caches of base stations. We consider a general content popularity distribution and a general distribution of the number of stations covering the typical location in the network. We are looking for a policy of content caching maximizing the probability of serving the typical content request from the caches of covering stations. The problem has a...

Topics: Networking and Internet Architecture, Computing Research Repository

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

5
5.0

Apr 27, 2017
04/17

Apr 27, 2017
by
Biao Zhang; Deyi Xiong; Jinsong Su

texts

######
eye 5

######
favorite 0

######
comment 0

Neural machine translation (NMT) heavily relies on an attention network to produce a context vector for each target word prediction. In practice, we find that context vectors for different target words are quite similar to one another and therefore are insufficient in discriminatively predicting target words. The reason for this might be that context vectors produced by the vanilla attention network are just a weighted sum of source representations that are invariant to decoder states. In this...

Topics: Computing Research Repository, Computation and Language

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

3
3.0

Apr 27, 2017
04/17

Apr 27, 2017
by
Mohammad A. Sedaghat; Ali Bereyhi; Ralf R. Müller

texts

######
eye 3

######
favorite 0

######
comment 0

A general class of nonlinear Least Square Error (LSE) precoders in multi-user multiple-input multiple-output systems is analyzed using the replica method from statistical mechanics. A single cell downlink channel with $N$ transmit antennas at the base station and $K$ single-antenna users is considered. The data symbols are assumed to be iid Gaussian and the precoded symbols on each transmit antenna are restricted to be chosen from a predefined set $\mathbb{X}$. The set $\mathbb{X}$ encloses...

Topics: Information Theory, Computing Research Repository, Mathematics

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

3
3.0

Apr 27, 2017
04/17

Apr 27, 2017
by
Vitor Bosshard; Bernd Gärtner

texts

######
eye 3

######
favorite 0

######
comment 0

A unique sink orientation (USO) is an orientation of the $n$-dimensional cube graph ($n$-cube) such that every face (subcube) has a unique sink. The number of unique sink orientations is $n^{\Theta(2^n)}$. If a cube orientation is not a USO, it contains a pseudo unique sink orientation (PUSO): an orientation of some subcube such that every proper face of it has a unique sink, but the subcube itself hasn't. In this paper, we characterize and count PUSOs of the $n$-cube. We show that PUSOs have a...

Topics: Discrete Mathematics, Combinatorics, Computing Research Repository, Mathematics

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

4
4.0

Apr 27, 2017
04/17

Apr 27, 2017
by
Scott Aaronson; Alexandru Cojocaru; Alexandru Gheorghiu; Elham Kashefi

texts

######
eye 4

######
favorite 0

######
comment 0

Suppose a large scale quantum computer becomes available over the Internet. Could we delegate universal quantum computations to this server, using only classical communication between client and server, in a way that is information-theoretically blind (i.e., the server learns nothing about the input apart from its size, with no cryptographic assumptions required)? In this paper we give strong indications that the answer is no. This contrasts with the situation where quantum communication...

Topics: Quantum Physics, Computational Complexity, Computing Research Repository

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

14
14

Apr 27, 2017
04/17

Apr 27, 2017
by
Boyue Wang; Yongli Hu; Junbin Gao; Yanfeng Sun; Haoran Chen; Baocai Yin

texts

######
eye 14

######
favorite 0

######
comment 0

Learning on Grassmann manifold has become popular in many computer vision tasks, with the strong capability to extract discriminative information for imagesets and videos. However, such learning algorithms particularly on high-dimensional Grassmann manifold always involve with significantly high computational cost, which seriously limits the applicability of learning on Grassmann manifold in more wide areas. In this research, we propose an unsupervised dimensionality reduction algorithm on...

Topics: Computing Research Repository, Computer Vision and Pattern Recognition

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

14
14

Apr 27, 2017
04/17

Apr 27, 2017
by
Ho Bae; Byunghan Lee; Sunyoung Kwon; Sungroh Yoon

texts

######
eye 14

######
favorite 0

######
comment 0

The technique of hiding messages in digital data is called a steganography technique. With improved sequencing techniques, increasing attempts have been conducted to hide hidden messages in deoxyribonucleic acid (DNA) sequences which have been become a medium for steganography. Many detection schemes have developed for conventional digital data, but these schemes not applicable to DNA sequences because of DNA's complex internal structures. In this paper, we propose the first DNA steganalysis...

Topics: Learning, Multimedia, Computing Research Repository

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

2
2.0

Apr 27, 2017
04/17

Apr 27, 2017
by
Chao Zhou; Chia-Wen Lin; Xinggong Zhang; Zongming Guo

texts

######
eye 2

######
favorite 0

######
comment 0

Dynamic adaptive streaming over HTTP (DASH) has recently been widely deployed in the Internet and adopted in the industry. It, however, does not impose any adaptation logic for selecting the quality of video fragments requested by clients and suffers from lackluster performance with respect to a number of desirable properties: efficiency, stability, and fairness when multiple players compete for a bottleneck link. In this paper, we propose a throughput-friendly DASH (TFDASH) rate control scheme...

Topics: Networking and Internet Architecture, Multimedia, Computing Research Repository

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

3
3.0

Apr 27, 2017
04/17

Apr 27, 2017
by
Dongrui Wu; Brent J. Lance; Vernon J. Lawhern; Stephen Gordon; Tzyy-Ping Jung; Chin-Teng Lin

texts

######
eye 3

######
favorite 0

######
comment 0

Riemannian geometry has been successfully used in many brain-computer interface (BCI) classification problems and demonstrated superior performance. In this paper, for the first time, it is applied to BCI regression problems, an important category of BCI applications. More specifically, we propose a new feature extraction approach for Electroencephalogram (EEG) based BCI regression problems: a spatial filter is first used to increase the signal quality of the EEG trials and also to reduce the...

Topics: Human-Computer Interaction, Learning, Computing Research Repository

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

5
5.0

Apr 27, 2017
04/17

Apr 27, 2017
by
Alp Ozdemir; Mark A. Iwen; Selin Aviyente

texts

######
eye 5

######
favorite 0

######
comment 0

The widespread use of multisensor technology and the emergence of big data sets have created the necessity to develop more versatile tools to represent large and multimodal data such as higher-order tensors. Tensor decomposition based methods have been shown to be flexible in the choice of the constraints and to extract more general latent components in such data compared to matrix-based methods. For these reasons, tensor decompositions have found applications in many different signal...

Topics: Numerical Analysis, Computing Research Repository

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

3
3.0

Apr 27, 2017
04/17

Apr 27, 2017
by
Chris Culnane; Benjamin I. P. Rubinstein; Vanessa Teague

texts

######
eye 3

######
favorite 0

######
comment 0

We consider the privacy implications of public release of a de-identified dataset of Opal card transactions. The data was recently published at https://opendata.transport.nsw.gov.au/dataset/opal-tap-on-and-tap-off. It consists of tap-on and tap-off counts for NSW's four modes of public transport, collected over two separate week-long periods. The data has been further treated to improve privacy by removing small counts, aggregating some stops and routes, and perturbing the counts. This is a...

Topics: Cryptography and Security, Computing Research Repository

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

7
7.0

Apr 27, 2017
04/17

Apr 27, 2017
by
Muhammad Usman; Irfan Ahmed; M. Imran Aslam; Shujaat Khan; Usman Ali Shah

texts

######
eye 7

######
favorite 0

######
comment 0

The Internet of Things (IoT) being a promising technology of the future is expected to connect billions of devices. The increased number of communication is expected to generate mountains of data and the security of data can be a threat. The devices in the architecture are essentially smaller in size and low powered. Conventional encryption algorithms are generally computationally expensive due to their complexity and requires many rounds to encrypt, essentially wasting the constrained energy...

Topics: Cryptography and Security, Information Theory, Computing Research Repository, Mathematics

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

5
5.0

Apr 27, 2017
04/17

Apr 27, 2017
by
Nicolas Honnorat; Christos Davatzikos

texts

######
eye 5

######
favorite 0

######
comment 0

Many neuroimaging studies focus on the cortex, in order to benefit from better signal to noise ratios and reduced computational burden. Cortical data are usually projected onto a reference mesh, where subsequent analyses are carried out. Several multiscale approaches have been proposed for analyzing these surface data, such as spherical harmonics and graph wavelets. As far as we know, however, the hierarchical structure of the template icosahedral meshes used by most neuroimaging software has...

Topics: Computing Research Repository, Computer Vision and Pattern Recognition

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

2
2.0

Apr 27, 2017
04/17

Apr 27, 2017
by
Ahmed Arafa; Sennur Ulukus

texts

######
eye 2

######
favorite 0

######
comment 0

We consider an energy harvesting two-hop network where a source is communicating to a destination through a relay. During a given communication session time, the source collects measurement updates from a physical phenomenon and sends them to the relay, which then forwards them to the destination. The objective is to send these updates to the destination as timely as possible; namely, such that the total age of information is minimized by the end of the communication session, subject to energy...

Topics: Networking and Internet Architecture, Information Theory, Computing Research Repository, Mathematics

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

4
4.0

Apr 27, 2017
04/17

Apr 27, 2017
by
Trivikram Dokka; Marc Goerigk

texts

######
eye 4

######
favorite 0

######
comment 0

Through the development of efficient algorithms, data structures and preprocessing techniques, real-world shortest path problems in street networks are now very fast to solve. But in reality, the exact travel times along each arc in the network may not be known. This lead to the development of robust shortest path problems, where all possible arc travel times are contained in a so-called uncertainty set of possible outcomes. Research in robust shortest path problems typically assumes this set...

Topics: Discrete Mathematics, Optimization and Control, Data Structures and Algorithms, Computing Research...

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

4
4.0

Apr 27, 2017
04/17

Apr 27, 2017
by
Britta Peis; José Verschae; Andreas Wierz

texts

######
eye 4

######
favorite 0

######
comment 0

We present a general approximation framework for weighted integer covering problems. In a weighted integer covering problem, the goal is to determine a non-negative integer solution $x$ to system $\{ Ax \geq r \}$ minimizing a non-negative cost function $c^T x$ (of appropriate dimensions). All coefficients in matrix $A$ are assumed to be non-negative. We analyze the performance of a very simple primal-dual greedy algorithm and discuss conditions of system $(A,r)$ that guarantee feasibility of...

Topics: Computing Research Repository, Discrete Mathematics

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

7
7.0

Apr 27, 2017
04/17

Apr 27, 2017
by
Quan Quan; Zhiyao Zhao; Liyong Lin; Peng Wang; Walter Murray Wonham; Kai-Yuan Cai

texts

######
eye 7

######
favorite 0

######
comment 0

In order to handle undesirable failures of a multicopter which occur in either the pre-flight process or the in-flight process, a failsafe mechanism design method based on supervisory control theory is proposed for the semi-autonomous control mode. Failsafe mechanism is a control logic that guides what subsequent actions the multicopter should take, by taking account of real-time information from guidance, attitude control, diagnosis, and other low-level subsystems. In order to design a...

Topics: Systems and Control, Computing Research Repository

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

7
7.0

Apr 27, 2017
04/17

Apr 27, 2017
by
Spyros Kontogiannis; Georgia Papastavrou; Andreas Paraskevopoulos; Dorothea Wagner; Christos Zaroliagis

texts

######
eye 7

######
favorite 0

######
comment 0

A novel landmark-based oracle (CFLAT) is presented, which provides earliest-arrival-time route plans in time-dependent road networks. To our knowledge, this is the first oracle that preprocesses combinatorial structures (collections of time-stamped min-travel-time-path trees) rather than travel-time functions. The preprocessed data structure is exploited by a new query algorithm (CFCA) which computes (and pays for it), apart from earliest-arrival-time estimations, the actual connecting path...

Topics: Data Structures and Algorithms, Computing Research Repository

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

2
2.0

Apr 27, 2017
04/17

Apr 27, 2017
by
Shayan Taheri; Jiann-Shiun Yuan

texts

######
eye 2

######
favorite 0

######
comment 0

Energy efficiency is one of the most important parameters for designing and building a computing system nowadays. Introduction of new transistor and memory technologies to the integrated circuits design have brought hope for low energy very large scale integration (VLSI) circuit design. This excellency is pleasant if the computing system is secure and the energy is not wasted through execution of malicious actions. In fact, it is required to make sure that the utilized transistor and memory...

Topics: Cryptography and Security, Computing Research Repository

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

6
6.0

Apr 27, 2017
04/17

Apr 27, 2017
by
Daniel Fett; Ralf Küsters; Guido Schmitz

texts

######
eye 6

######
favorite 0

######
comment 0

Web-based single sign-on (SSO) services such as Google Sign-In and Log In with Paypal are based on the OpenID Connect protocol. This protocol enables so-called relying parties to delegate user authentication to so-called identity providers. OpenID Connect is one of the newest and most widely deployed single sign-on protocols on the web. Despite its importance, it has not received much attention from security researchers so far, and in particular, has not undergone any rigorous security...

Topics: Cryptography and Security, Computing Research Repository

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

4
4.0

Apr 27, 2017
04/17

Apr 27, 2017
by
Shahar Dobzinski; Shahar Ovadia

texts

######
eye 4

######
favorite 0

######
comment 0

We introduce a combinatorial variant of the cost sharing problem: several services can be provided to each player and each player values every combination of services differently. A publicly known cost function specifies the cost of providing every possible combination of services. A combinatorial cost sharing mechanism is a protocol that decides which services each player gets and at what price. We look for dominant strategy mechanisms that are (economically) efficient and cover the cost,...

Topics: Computer Science and Game Theory, Computing Research Repository

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

5
5.0

Apr 27, 2017
04/17

Apr 27, 2017
by
Dieter Hendricks; Stephen J. Roberts

texts

######
eye 5

######
favorite 0

######
comment 0

The process of liquidity provision in financial markets can result in prolonged exposure to illiquid instruments for market makers. In this case, where a proprietary position is not desired, pro-actively targeting the right client who is likely to be interested can be an effective means to offset this position, rather than relying on commensurate interest arising through natural demand. In this paper, we consider the inference of a client profile for the purpose of corporate bond...

Topics: Quantitative Finance, Learning, Computing Research Repository, Machine Learning, Statistics,...

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

6
6.0

Apr 27, 2017
04/17

Apr 27, 2017
by
Philip Bille; Inge Li Gørtz; Nicola Prezza

texts

######
eye 6

######
favorite 0

######
comment 0

Re-Pair is an efficient grammar compressor that operates by recursively replacing high-frequency character pairs with new grammar symbols. The most space-efficient linear-time algorithm computing Re-Pair uses $(1+\epsilon)n+\sqrt n$ words on top of the re-writable text (of length $n$ and stored in $n$ words), for any constant $\epsilon>0$; in practice however, this solution uses complex sub-procedures preventing it from being practical. In this paper, we present an implementation of the...

Topics: Data Structures and Algorithms, Computing Research Repository

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

4
4.0

Apr 27, 2017
04/17

Apr 27, 2017
by
Bastien Moysset; Christopher Kermorvant; Christian Wolf

texts

######
eye 4

######
favorite 0

######
comment 0

Text line detection and localization is a crucial step for full page document analysis, but still suffers from heterogeneity of real life documents. In this paper, we present a new approach for full page text recognition. Localization of the text lines is based on regressions with Fully Convolutional Neural Networks and Multidimensional Long Short-Term Memory as contextual layers. In order to increase the efficiency of this localization method, only the position of the left side of the text...

Topics: Computing Research Repository, Computer Vision and Pattern Recognition

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

6
6.0

Apr 27, 2017
04/17

Apr 27, 2017
by
Panagiotis Tzirakis; George Trigeorgis; Mihalis A. Nicolaou; Björn Schuller; Stefanos Zafeiriou

texts

######
eye 6

######
favorite 0

######
comment 0

Automatic affect recognition is a challenging task due to the various modalities emotions can be expressed with. Applications can be found in many domains including multimedia retrieval and human computer interaction. In recent years, deep neural networks have been used with great success in determining emotional states. Inspired by this success, we propose an emotion recognition system using auditory and visual modalities. To capture the emotional content for various styles of speaking, robust...

Topics: Computing Research Repository, Computer Vision and Pattern Recognition, Computation and Language

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

16
16

Apr 27, 2017
04/17

Apr 27, 2017
by
Irati Zamalloa; Risto Kojcev; Alejandro Hernández; Iñigo Muguruza; Lander Usategui; Asier Bilbao; Víctor Mayoral

texts

######
eye 16

######
favorite 0

######
comment 0

Robotics is called to be the next technological revolution and estimations indicate that it will trigger the fourth industrial revolution. This article presents a review of some of the most relevant milestones that occurred in robotics over the last few decades and future perspectives. Despite the fact that, nowadays, robotics is an emerging field, the challenges in many technological aspects and more importantly bringing innovative solutions to the market still remain open. The need of...

Topics: Computing Research Repository, Robotics

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

10
10.0

Apr 27, 2017
04/17

Apr 27, 2017
by
Hengshuang Zhao; Xiaojuan Qi; Xiaoyong Shen; Jianping Shi; Jiaya Jia

texts

######
eye 10

######
favorite 0

######
comment 0

We focus on the challenging task of realtime semantic segmentation in this paper. It finds many practical applications and yet is with fundamental difficulty of reducing a large portion of computation for pixel-wise label inference. We propose an compressed-PSPNet-based image cascade network (ICNet) that incorporates multi-resolution branches under proper label guidance to address this challenge. We provide in-depth analysis of our framework and introduce the cascade feature fusion to quickly...

Topics: Computing Research Repository, Computer Vision and Pattern Recognition

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

10
10.0

Apr 27, 2017
04/17

Apr 27, 2017
by
Seungkyu Shin; Juyong Park

texts

######
eye 10

######
favorite 0

######
comment 0

In the modern era where highly-commodified cultural products compete heavily for mass consumption, finding the principles behind the complex process of how successful, "hit" products emerge remains a vital scientific goal that requires an interdisciplinary approach. Here we present a framework for tracing the cycle of prosperity-and-decline of a product to find insights into influential and potent factors that determine its success. As a rapid, high-throughput indicator of the...

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

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

4
4.0

Apr 27, 2017
04/17

Apr 27, 2017
by
Édouard Bonnet; Serge Gaspers; Antonin Lambilliotte; Stefan Rümmele; Abdallah Saffidine

texts

######
eye 4

######
favorite 0

######
comment 0

We study the parameterized complexity of several positional games. Our main result is that Short Generalized Hex is W[1]-complete parameterized by the number of moves. This solves an open problem from Downey and Fellows' influential list of open problems from 1999. Previously, the problem was thought of as a natural candidate for AW[*]-completeness. Our main tool is a new fragment of first-order logic where universally quantified variables only occur in inequalities. We show that model-checking...

Topics: Computational Complexity, Computing Research Repository

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

4
4.0

Apr 27, 2017
04/17

Apr 27, 2017
by
Pascal Schweitzer

texts

######
eye 4

######
favorite 0

######
comment 0

The paper develops a new technique to extract a characteristic subset from a random source that repeatedly samples from a set of elements. Here a characteristic subset is a set that when containing an element contains all elements that have the same probability. With this technique at hand the paper looks at the special case of the tournament isomorphism problem that stands in the way towards a polynomial-time algorithm for the graph isomorphism problem. Noting that there is a reduction from...

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

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

3
3.0

Apr 27, 2017
04/17

Apr 27, 2017
by
Boštjan Brešar; Tanja Gologranc; Tim Kos

texts

######
eye 3

######
favorite 0

######
comment 0

A set $D$ of vertices in a graph $G$ is a dominating set if every vertex of $G$, which is not in $D$, has a neighbor in $D$. A set of vertices $D$ in $G$ is convex (respectively, isometric), if all vertices in all shortest paths (respectively, all vertices in one of the shortest paths) between any two vertices in $D$ lie in $D$. The problem of finding a minimum convex dominating (respectively, isometric dominating) set is considered in this paper from algorithmic point of view. For the class of...

Topics: Discrete Mathematics, Combinatorics, Computing Research Repository, Mathematics

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

4
4.0

Apr 27, 2017
04/17

Apr 27, 2017
by
Javier Rodríguez-Fernández; Nuria González-Prelcic; Kiran Venugopal; Robert W. Heath

texts

######
eye 4

######
favorite 0

######
comment 0

Channel estimation is useful in millimeter wave (mmWave) MIMO communication systems. Channel state information allows optimized designs of precoders and combiners under different metrics such as mutual information or signal-to-interference-noise (SINR) ratio. At mmWave, MIMO precoders and combiners are usually hybrid, since this architecture provides a means to trade-off power consumption and achievable rate. Channel estimation is challenging when using these architectures, however, since there...

Topics: Information Theory, Computing Research Repository, Mathematics

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

3
3.0

Apr 27, 2017
04/17

Apr 27, 2017
by
Phuong Nguyen; Klara Nahrstedt

texts

######
eye 3

######
favorite 0

######
comment 0

In recent years, there have been efforts to collect human contact traces during social events (e.g., conferences) using Bluetooth devices (e.g., mobile phones, iMotes). The results of these studies have enabled the ability to do the crowd-sourcing task from within the crowd, in order to answer questions, such as: what is the current density of the crowd, or how many people are attending the event? However, in those studies, the sensing devices are usually distributed and configured in a certain...

Topics: Computing Research Repository, Social and Information Networks

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

4
4.0

Apr 27, 2017
04/17

Apr 27, 2017
by
Elisabetta Bergamini; Henning Meyerhenke; Mark Ortmann; Arie Slobbe

texts

######
eye 4

######
favorite 0

######
comment 0

Finding central nodes is a fundamental problem in network analysis. Betweenness centrality is a well-known measure which quantifies the importance of a node based on the fraction of shortest paths going though it. Due to the dynamic nature of many today's networks, algorithms that quickly update centrality scores have become a necessity. For betweenness, several dynamic algorithms have been proposed over the years, targeting different update types (incremental- and decremental-only,...

Topics: Data Structures and Algorithms, Computing Research Repository

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

6
6.0

Apr 27, 2017
04/17

Apr 27, 2017
by
Niel de Beaudrap; Dominic Horsman

texts

######
eye 6

######
favorite 0

######
comment 0

Quantum computing is moving rapidly to the point of deployment of technology. Functional quantum devices will require the ability to correct error in order to be scalable and effective. A leading choice of error correction, in particular for modular or distributed architectures, is the surface code with logical two-qubit operations realised via "lattice surgery". These operations consist of "merges" and "splits" acting non-unitarily on the logical states and are...

Topics: Logic in Computer Science, Quantum Physics, Computing Research Repository

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

5
5.0

Apr 27, 2017
04/17

Apr 27, 2017
by
Vineet John

texts

######
eye 5

######
favorite 0

######
comment 0

This paper aims to catalyze the discussions about text feature extraction techniques using neural network architectures. The research questions discussed in the paper focus on the state-of-the-art neural network techniques that have proven to be useful tools for language processing, language generation, text classification and other computational linguistics tasks.

Topics: Computing Research Repository, Computation and Language

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

3
3.0

Apr 27, 2017
04/17

Apr 27, 2017
by
Yi-Hsin Chen; Wei-Yu Chen; Yu-Ting Chen; Bo-Cheng Tsai; Yu-Chiang Frank Wang; Min Sun

texts

######
eye 3

######
favorite 0

######
comment 0

Despite the recent success of deep-learning based semantic segmentation, deploying a pre-trained road scene segmenter to a city whose images are not presented in the training set would not achieve satisfactory performance due to dataset biases. Instead of collecting a large number of annotated images of each city of interest to train or refine the segmenter, we propose an unsupervised learning approach to adapt road scene segmenters across different cities. By utilizing Google Street View and...

Topics: Artificial Intelligence, Computing Research Repository, Computer Vision and Pattern Recognition

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

8
8.0

Apr 27, 2017
04/17

Apr 27, 2017
by
Matthias Kümmerer; Thomas S. A. Wallis; Matthias Bethge

texts

######
eye 8

######
favorite 0

######
comment 0

The field of fixation prediction is heavily model-driven, with dozens of new models published every year. However, progress in the field can be difficult to judge because models are compared using a variety of inconsistent metrics. As soon as a saliency map is optimized for a certain metric, it is penalized by other metrics. Here we propose a principled approach to solve the benchmarking problem: we separate the notions of saliency models and saliency maps. We define a saliency model to be a...

Topics: Statistics, Applications, Computing Research Repository, Computer Vision and Pattern Recognition

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

4
4.0

Apr 27, 2017
04/17

Apr 27, 2017
by
S. Luna Frank-Fischer; Venkatesan Guruswami; Mary Wootters

texts

######
eye 4

######
favorite 0

######
comment 0

In error-correcting codes, locality refers to several different ways of quantifying how easily a small amount of information can be recovered from encoded data. In this work, we study a notion of locality called the s-Disjoint-Repair-Group Property (s-DRGP). This notion can interpolate between two very different settings in coding theory: that of Locally Correctable Codes (LCCs) when s is large---a very strong guarantee---and Locally Recoverable Codes (LRCs) when s is small---a relatively...

Topics: Information Theory, Computing Research Repository, Mathematics

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

4
4.0

Apr 27, 2017
04/17

Apr 27, 2017
by
Zengfeng Huang; Bozidar Radunovic; Milan Vojnovic; Qin Zhang

texts

######
eye 4

######
favorite 0

######
comment 0

We consider the communication complexity of finding an approximate maximum matching in a graph in a multi-party message-passing communication model. The maximum matching problem is one of the most fundamental graph combinatorial problems, with a variety of applications. The input to the problem is a graph $G$ that has $n$ vertices and the set of edges partitioned over $k$ sites, and an approximation ratio parameter $\alpha$. The output is required to be a matching in $G$ that has to be reported...

Topics: Data Structures and Algorithms, Computing Research Repository

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

2
2.0

Apr 27, 2017
04/17

Apr 27, 2017
by
Zhiwei Lin; Yi Li; Xiaolian Guo

texts

######
eye 2

######
favorite 0

######
comment 0

Rankings are widely used in many information systems. In information retrieval, a ranking is a list of ordered documents, in which a document with lower position has higher ranking score than the documents behind it. This paper studies the consensus measure for a given set of rankings, in order to understand the degree to which the rankings agree and the extent to which the rankings are related. The proposed multi-facet approach, without the need for pairwise comparison between rankings, allows...

Topics: Artificial Intelligence, Computing Research Repository

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

7
7.0

Apr 27, 2017
04/17

Apr 27, 2017
by
Rana Alkadhi; Teodora Lata; Emitza Guzman; Bernd Bruegge

texts

######
eye 7

######
favorite 0

######
comment 0

Chat messages of development teams play an increasingly significant role in software development, having replaced emails in some cases. Chat messages contain information about discussed issues, considered alternatives and argumentation leading to the decisions made during software development. These elements, defined as rationale, are invaluable during software evolution for documenting and reusing development knowledge. Rationale is also essential for coping with changes and for effective...

Topics: Software Engineering, Computing Research Repository

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

4
4.0

Apr 26, 2017
04/17

Apr 26, 2017
by
Gerco van Heerdt; Matteo Sammartino; Alexandra Silva

texts

######
eye 4

######
favorite 0

######
comment 0

Automata learning has been successfully applied in the verification of hardware and software. The size of the automaton model learned is a bottleneck for scalability and hence optimizations that enable learning of compact representations are important. In this paper, we continue the development of a general framework for automata learning based on category theory and develop a class of optimizations and an accompanying correctness proof for learning algorithms. The new algorithm is parametric...

Topics: Logic in Computer Science, Formal Languages and Automata Theory, Computing Research Repository

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

2
2.0

Apr 26, 2017
04/17

Apr 26, 2017
by
Samuel Rönnqvist; Niko Schenk; Christian Chiarcos

texts

######
eye 2

######
favorite 0

######
comment 0

We introduce an attention-based Bi-LSTM for Chinese implicit discourse relations and demonstrate that modeling argument pairs as a joint sequence can outperform word order-agnostic approaches. Our model benefits from a partial sampling scheme and is conceptually simple, yet achieves state-of-the-art performance on the Chinese Discourse Treebank. We also visualize its attention activity to illustrate the model's ability to selectively focus on the relevant parts of an input sequence.

Topics: Learning, Neural and Evolutionary Computing, Artificial Intelligence, Computing Research...

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

2
2.0

Apr 26, 2017
04/17

Apr 26, 2017
by
Nir Shlezinger; Ron Dabora; Yonina C. Eldar

texts

######
eye 2

######
favorite 0

######
comment 0

In phase retrieval problems, a signal of interest (SOI) is reconstructed based on the magnitude of a linear transformation of the SOI observed with additive noise. The linear transform is typically referred to as a measurement matrix. Many works on phase retrieval assume that the measurement matrix is a random Gaussian matrix, which, in the noiseless scenario with sufficiently many measurements, guarantees invertability of the transformation between the SOI and the observations, up to an...

Topics: Information Theory, Computing Research Repository, Mathematics

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

3
3.0

Apr 26, 2017
04/17

Apr 26, 2017
by
Gilberto Martinez; Janito V. Ferreira Filho; Eduardo X. Miqueles

texts

######
eye 3

######
favorite 0

######
comment 0

In this manuscript we present a fast GPU implementation for tomographic reconstruction of large datasets using data obtained at the Brazilian synchrotron light source. The algorithm is distributed in a cluster with 4 GPUs through a fast pipeline implemented in C programming language. Our algorithm is theoretically based on a recently discovered low complexity formula, computing the total volume within O(N3logN) floating point operations; much less than traditional algorithms that operates with...

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

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

3
3.0

Apr 26, 2017
04/17

Apr 26, 2017
by
Elyor Kodirov; Tao Xiang; Shaogang Gong

texts

######
eye 3

######
favorite 0

######
comment 0

Existing zero-shot learning (ZSL) models typically learn a projection function from a feature space to a semantic embedding space (e.g.~attribute space). However, such a projection function is only concerned with predicting the training seen class semantic representation (e.g.~attribute prediction) or classification. When applied to test data, which in the context of ZSL contains different (unseen) classes without training data, a ZSL model typically suffers from the project domain shift...

Topics: Computing Research Repository, Computer Vision and Pattern Recognition

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