6
6.0
Aug 17, 2020
08/20
Aug 17, 2020
by
Xiao Lu; Dusit Niyato; Ping Wang; Dong In Kim; Zhu Han
texts
eye 6
favorite 0
comment 1
Wireless charging is a technique of transmitting power through an air gap to an electrical device for the purpose of energy replenishment. Recently, the wireless charging technology has been significantly advanced in terms of efficiency and functionality. This article first presents an overview and fundamentals of wireless charging. We then provide the review of standards, i.e., Qi and Alliance for Wireless Power (A4WP), and highlight on their communication protocols. Next, we propose a novel...
favoritefavoritefavoritefavoritefavorite ( 1 reviews )
Topics: Networking and Internet Architecture, Computing Research Repository
Source: http://arxiv.org/abs/1410.8635
8
8.0
Sep 13, 2019
09/19
Sep 13, 2019
by
David Fifield; Lynn Tsai
texts
eye 8
favorite 0
comment 1
Censors of the Internet must continually discover and block new circumvention proxy servers. We seek to understand this process; specifically, the length of the delay between when a proxy first becomes discoverable and when it is actually blocked. We measure this delay in the case of obfuscated Tor bridges, by testing their reachability before and after their introduction into Tor Browser. We test from sites in the U.S., China, and Iran, over a period of five months. China's national firewall...
( 1 reviews )
Topics: Cryptography and Security, Computing Research Repository
Source: http://arxiv.org/abs/1605.08808
2
2.0



by
Ganesh P Kumar; Spring Berman
texts
eye 2
favorite 0
comment 0
We do a Probabilistic Analysis of the Network generated by robots involved in Stochastic Boundary Coverage
Topics: Computing Research Repository, Robotics
Source: http://arxiv.org/abs/1604.01452
2
2.0



by
Barret Zoph; Deniz Yuret; Jonathan May; Kevin Knight
texts
eye 2
favorite 0
comment 0
The encoderdecoder framework for neural machine translation (NMT) has been shown effective in large data scenarios, but is much less effective for lowresource languages. We present a transfer learning method that significantly improves Bleu scores across a range of lowresource languages. Our key idea is to first train a highresource language pair (the parent model), then transfer some of the learned parameters to the lowresource pair (the child model) to initialize and constrain training....
Topics: Computation and Language, Computing Research Repository
Source: http://arxiv.org/abs/1604.02201
3
3.0



by
Dong Liu; Chenyang Yang
texts
eye 3
favorite 0
comment 0
Caching at base stations (BSs) is a promising way to offload traffic and eliminate backhaul bottleneck in heterogeneous networks (HetNets). In this paper, we investigate the optimal content placement maximizing the successful offloading probability in a cacheenabled HetNet where a tier of multiantenna macro BSs (MBSs) is overlaid with a tier of helpers with caches. Based on probabilistic caching framework, we resort to stochastic geometry theory to derive the closedform successful offloading...
Topics: Information Theory, Computing Research Repository, Mathematics
Source: http://arxiv.org/abs/1604.03280
2
2.0



by
FengLin Li; ChiHung Chi; Yue Wang; Cong Liu
texts
eye 2
favorite 0
comment 0
Software as a service (SaaS) has recently enjoyed much attention as it makes the use of software more convenient and costeffective. At the same time, the arising of users' expectation for high quality service such as realtime information or functionality provisioning brings about new challenges: to satisfy such (near) realtime requirements, realtime monitoring and effective processing of streaming data is necessary. However, due to the composition structure and multiinstance property of...
Topics: Software Engineering, Computing Research Repository
Source: http://arxiv.org/abs/1604.03453
2
2.0



by
Tanmoy Chakraborty; Ayushi Dalmia; Animesh Mukherjee; Niloy Ganguly
texts
eye 2
favorite 0
comment 0
Detecting and analyzing dense groups or communities from social and information networks has attracted immense attention over last one decade due to its enormous applicability in different domains. Community detection is an illdefined problem, as the nature of the communities is not known in advance. The problem has turned out to be even complicated due to the fact that communities emerge in the network in various forms  disjoint, overlapping, hierarchical etc. Various heuristics have been...
Topics: Physics and Society, Physics, Computing Research Repository, Social and Information Networks
Source: http://arxiv.org/abs/1604.03512
4
4.0



by
Eva L. Dyer; William Gray Roncal; Hugo L. Fernandes; Doga Gürsoy; Vincent De Andrade; Rafael Vescovi; Kamel Fezzaa; Xianghui Xiao; Joshua T. Vogelstein; Chris Jacobsen; Konrad P. Körding; Narayanan Kasthuri
texts
eye 4
favorite 0
comment 0
Methods for resolving the 3D microstructure of the brain typically start by thinly slicing and staining the brain, and then imaging each individual section with visible light photons or electrons. In contrast, Xrays can be used to image thick samples, providing a rapid approach for producing large 3D brain maps without sectioning. Here we demonstrate the use of synchrotron Xray microtomography ($\mu$CT) for producing mesoscale $(1~\mu m^3)$ resolution brain maps from millimeterscale volumes...
Topics: Quantitative Biology, Computer Vision and Pattern Recognition, Quantitative Methods, Computing...
Source: http://arxiv.org/abs/1604.03629
3
3.0



by
Haim Kaplan; Wolfgang Mulzer; Liam Roditty; Paul Seiferth; Micha Sharir
texts
eye 3
favorite 0
comment 0
We describe a new data structure for dynamic nearest neighbor queries in the plane with respect to a general family of distance functions that includes $L_p$norms and additively weighted Euclidean distances, and for general (convex, pairwise disjoint) sites that have constant description complexity (line segments, disks, etc.). Our data structure has a polylogarithmic update and query time, improving an earlier data structure of Agarwal, Efrat and Sharir that required $O(n^\varepsilon)$ time...
Topics: Data Structures and Algorithms, Computational Geometry, Computing Research Repository
Source: http://arxiv.org/abs/1604.03654
3
3.0



by
Dylan Hutchison; Bill Howe; Dan Suciu
texts
eye 3
favorite 0
comment 0
Data processing systems roughly group into families such as relational, array, graph, and keyvalue. Many data processing tasks exceed the capabilities of any one family, require data stored across families, or run faster when partitioned onto multiple families. Discovering ways to execute computation among multiple available systems, let alone discovering an optimal execution plan, is challenging given semantic differences between disparate families of systems. In this paper we introduce a new...
Topics: Databases, Programming Languages, Computing Research Repository
Source: http://arxiv.org/abs/1604.03607
7
7.0
texts
eye 7
favorite 0
comment 0
Community detection algorithms are fundamental tools to understand organizational principles in social networks. With the increasing power of social media platforms, when detecting communities there are two possi ble sources of information one can use: the structure of social network and node attributes. However structure of social networks and node attributes are often interpreted separately in the research of community detection. When these two sources are interpreted simultaneously, one...
Topics: Social and Information Networks, Machine Learning, Physics, Statistics, Computing Research...
Source: http://arxiv.org/abs/1604.03601
4
4.0



by
Mayank Baranwal; Srinivasa M. Salapaka; Murti V. Salapaka
texts
eye 4
favorite 0
comment 0
This paper addresses the problem of output voltage regulation for multiple DCDC converters connected to a grid, and prescribes a robust scheme for sharing power among different sources. Also it develops a method for sharing 120 Hz ripple among DC power sources in a prescribed proportion, which accommodates the different capabilities of DC power sources to sustain the ripple. We present a decentralized control architecture, where a nested (innerouter) control design is used at every converter....
Topics: Optimization and Control, Systems and Control, Computing Research Repository, Mathematics
Source: http://arxiv.org/abs/1604.03573
2
2.0



by
Mostafa ElKhamy; HsienPing Lin; Jungwon Lee
texts
eye 2
favorite 0
comment 0
Polar codes are considered the latest major breakthrough in coding theory. Polar codes were introduced by Ar{\i}kan in 2008. In this letter, we show that the binary polar codes are the same as the optimized codes for bitwise multistage decoding (OCBM), which have been discovered before by Stolte in 2002. The equivalence between the techniques used for the constructions and decodings of both codes is established.
Topics: Information Theory, Computing Research Repository, Mathematics
Source: http://arxiv.org/abs/1604.03612
2
2.0



by
Rong Ge; Chi Jin; Sham M. Kakade; Praneeth Netrapalli; Aaron Sidford
texts
eye 2
favorite 0
comment 0
This paper considers the problem of canonicalcorrelation analysis (CCA) (Hotelling, 1936) and, more broadly, the generalized eigenvector problem for a pair of symmetric matrices. These are two fundamental problems in data analysis and scientific computing with numerous applications in machine learning and statistics (Shi and Malik, 2000; Hardoon et al., 2004; Witten et al., 2009). We provide simple iterative algorithms, with improved runtimes, for solving these problems that are globally...
Topics: Machine Learning, Mathematics, Optimization and Control, Statistics, Learning, Computing Research...
Source: http://arxiv.org/abs/1604.03930
4
4.0



by
Daniel Lokshtanov; Fahad Panolan; M. S. Ramanujan; Saket Saurabh
texts
eye 4
favorite 0
comment 0
In this paper we propose a new framework for analyzing the performance of preprocessing algorithms. Our framework builds on the notion of kernelization from parameterized complexity. However, as opposed to the original notion of kernelization, our definitions combine well with approximation algorithms and heuristics. The key new definition is that of a polynomial size $\alpha$approximate kernel. Loosely speaking, a polynomial size $\alpha$approximate kernel is a polynomial time preprocessing...
Topics: Data Structures and Algorithms, Computing Research Repository
Source: http://arxiv.org/abs/1604.04111
4
4.0



by
E. Osaba; XinShe Yang; F. Diaz; E. Onieva; A. D. Masegosa; A. Perallos
texts
eye 4
favorite 0
comment 0
A realworld newspaper distribution problem with recycling policy is tackled in this work. In order to meet all the complex restrictions contained in such a problem, it has been modeled as a rich vehicle routing problem, which can be more specifically considered as an asymmetric and clustered vehicle routing problem with simultaneous pickup and deliveries, variable costs and forbidden paths (ACVRPSPDVCFP). This is the first study of such a problem in the literature. For this reason, a...
Topics: Optimization and Control, Artificial Intelligence, Neural and Evolutionary Computing, Computing...
Source: http://arxiv.org/abs/1604.04146
2
2.0



by
Walter Kern; Bodo Manthey; Marc Uetz
texts
eye 2
favorite 0
comment 0
In \cite{EK10} the use of VCG in matching markets is motivated by saying that in order to compute market clearing prices in a matching market, the auctioneer needs to know the true valuations of the bidders. Hence VCG and corresponding personalized prices are proposed as an incentive compatible mechanism. The same line of argument pops up in several lecture sheets and other documents related to courses based on Easley and Kleinberg's book, seeming to suggest that computing market clearing...
Topics: Computing Research Repository, Computer Science and Game Theory
Source: http://arxiv.org/abs/1604.04157
2
2.0



by
Juan Wen; Min Sheng; Kaibin Huang; Jiandong Li
texts
eye 2
favorite 0
comment 0
The correlation of interference has been well quantified in Poisson networks where the interferers are independent of each other. However, there exists dependence among the base stations (BSs) in wireless networks. In view of this, we quantify the interference correlation in nonPoisson networks where the interferers are distributed as a Matern cluster process (MCP) and a secondorder cluster process (SOCP). Interestingly, it is found that the correlation coefficient of interference for the...
Topics: Information Theory, Computing Research Repository, Mathematics
Source: http://arxiv.org/abs/1604.04166
2
2.0



by
ChaoYeh Chen; Kristen Grauman
texts
eye 2
favorite 0
comment 0
Understanding images with people often entails understanding their \emph{interactions} with other objects or people. As such, given a novel image, a vision system ought to infer which other objects/people play an important role in a given person's activity. However, existing methods are limited to learning actionspecific interactions (e.g., how the pose of a tennis player relates to the position of his racquet when serving the ball) for improved recognition, making them unequipped to reason...
Topics: Computer Vision and Pattern Recognition, Computing Research Repository
Source: http://arxiv.org/abs/1604.04842
3
3.0



by
Yongchao Liu; Srinivas Aluru
texts
eye 3
favorite 0
comment 0
Scan (or prefix sum) is a fundamental and widely used primitive in parallel computing. In this paper, we present LightScan, a faster parallel scan primitive for CUDAenabled GPUs, which investigates a hybrid model combining intrablock computation and interblock communication to perform a scan. Our algorithm employs warp shuffle functions to implement fast intrablock computation and takes advantage of globally coherent L2 cache and the associated parallel thread execution (PTX) assembly...
Topics: Distributed, Parallel, and Cluster Computing, Computing Research Repository
Source: http://arxiv.org/abs/1604.04815
2
2.0



by
Moran Feldman; Rica Gonen
texts
eye 2
favorite 0
comment 0
The study of mechanisms for multisided markets has received an increasingly growing attention from the research community, and is motivated by the numerous examples of such markets on the web and in electronic commerce. Many of these examples represent dynamic and uncertain environments, and thus, require, in fact, online mechanisms. Unfortunately, as far as we know, no previously published online mechanism for a multisided market (or even for a doublesided market) has managed to...
Topics: Computing Research Repository, Computer Science and Game Theory
Source: http://arxiv.org/abs/1604.04859
2
2.0



by
Yang Liu; Yiling Chen
texts
eye 2
favorite 0
comment 0
In crowdsourcing when there is a lack of verification for contributed answers, output agreement mechanisms are often used to incentivize participants to provide truthful answers when the correct answer is hold by the majority. In this paper, we focus on using output agreement mechanisms to elicit effort, in addition to eliciting truthful answers, from a population of workers. We consider a setting where workers have heterogeneous cost of effort exertion and examine the data requester's problem...
Topics: HumanComputer Interaction, Artificial Intelligence, Computing Research Repository, Computer...
Source: http://arxiv.org/abs/1604.04928
3
3.0
texts
eye 3
favorite 0
comment 0
Examplebased superresolution (EBSR) reconstructs a highresolution image from a lowresolution image, given a training set of highresolution images. In this note I propose some applications of EBSR to medical imaging. A particular interesting application, which I call "xray voxelization", approximates the result of a CT scan from an xray image.
Topics: Computer Vision and Pattern Recognition, Computing Research Repository
Source: http://arxiv.org/abs/1604.04926
3
3.0
texts
eye 3
favorite 0
comment 0
We introduce a new Steinertype problem for directed graphs named \textsc{$q$Root Steiner Tree}. Here one is given a directed graph $G=(V,A)$ and two subsets of its vertices, $R$ of size $q$ and $T$, and the task is to find a minimum size subgraph of $G$ that contains a path from each vertex of $R$ to each vertex of $T$. The special case of this problem with $q=1$ is the well known \textsc{Directed Steiner Tree} problem, while the special case with $T=R$ is the \textsc{Strongly Connected...
Topics: Data Structures and Algorithms, Computing Research Repository
Source: http://arxiv.org/abs/1604.05103
2
2.0



by
Peter Ondruska; Julie Dequaire; Dominic Zeng Wang; Ingmar Posner
texts
eye 2
favorite 0
comment 0
In this work we present a novel endtoend framework for tracking and classifying a robot's surroundings in complex, dynamic and only partially observable realworld environments. The approach deploys a recurrent neural network to filter an input stream of raw laser measurements in order to directly infer object locations, along with their identity in both visible and occluded areas. To achieve this we first train the network using unsupervised Deep Tracking, a recently proposed theoretical...
Topics: Computer Vision and Pattern Recognition, Artificial Intelligence, Learning, Neural and Evolutionary...
Source: http://arxiv.org/abs/1604.05091
3
3.0



by
Jonas Uhrig; Marius Cordts; Uwe Franke; Thomas Brox
texts
eye 3
favorite 0
comment 0
Recent approaches for instanceaware semantic labeling have augmented convolutional neural networks (CNNs) with complex multitask architectures or computationally expensive graphical models. We present a method that leverages a fully convolutional network (FCN) to predict semantic labels, depth and an instancebased encoding using each pixel's direction towards its corresponding instance center. Subsequently, we apply lowlevel computer vision techniques to generate stateoftheart instance...
Topics: Computer Vision and Pattern Recognition, Computing Research Repository
Source: http://arxiv.org/abs/1604.05096
3
3.0



by
Yuri M. Dimitrov; Lubin G. Vulkov
texts
eye 3
favorite 0
comment 0
We construct a threepoint compact finite difference scheme on a nonuniform mesh for the timefractional BlackScholes equation. We show that for special graded meshes used in finance, the TavellaRandall and the quadratic meshes the numerical solution has a fourthorder accuracy in space. Numerical experiments are discussed.
Topics: Computational Finance, Computational Engineering, Finance, and Science, Quantitative Finance,...
Source: http://arxiv.org/abs/1604.05178
3
3.0



by
Scott Garrabrant; Benya Fallenstein; Abram Demski; Nate Soares
texts
eye 3
favorite 0
comment 0
While probability theory is normally applied to external environments, there has been some recent interest in probabilistic modeling of the outputs of computations that are too expensive to run. Since mathematical logic is a powerful tool for reasoning about computer programs, we consider this problem from the perspective of integrating probability and logic. Recent work on assigning probabilities to mathematical statements has used the concept of coherent distributions, which satisfy logical...
Topics: Mathematics, Probability, Artificial Intelligence, Computing Research Repository, Learning
Source: http://arxiv.org/abs/1604.05288
2
2.0



by
Manuel Wettstein
texts
eye 2
favorite 0
comment 0
We describe a framework for counting and enumerating various types of crossingfree geometric graphs on a planar point set. The framework generalizes ideas of Alvarez and Seidel, who used them to count triangulations in time $O(2^nn^2)$ where $n$ is the number of points. The main idea is to reduce the problem of counting geometric graphs to counting sourcesink paths in a directed acyclic graph. The following new results will emerge. The number of all crossingfree geometric graphs can be...
Topics: Computational Geometry, Computing Research Repository
Source: http://arxiv.org/abs/1604.05350
4
4.0



by
Anatoliy Zinovyev; Brian L. Mark
texts
eye 4
favorite 0
comment 0
Routing in mobile ad hoc networks (MANETs) presents a big challenge, especially when support for a large number of nodes is needed. This paper extends the local visibility concept of the recent DHTbased URBAN_XOR routing protocol, which aims to reduce routing table sizes while keeping efficiency high. Our main contribution is providing a guarantee that if any two nodes are connected through other nodes, they are able to communicate with each other. We propose a new route acquisition method...
Topics: Networking and Internet Architecture, Computing Research Repository
Source: http://arxiv.org/abs/1604.05430
2
2.0



by
Tinghui Zhou; Philipp Krähenbühl; Mathieu Aubry; Qixing Huang; Alexei A. Efros
texts
eye 2
favorite 0
comment 0
Discriminative deep learning approaches have shown impressive results for problems where humanlabeled ground truth is plentiful, but what about tasks where labels are difficult or impossible to obtain? This paper tackles one such problem: establishing dense visual correspondence across different object instances. For this task, although we do not know what the groundtruth is, we know it should be consistent across instances of that category. We exploit this consistency as a supervisory signal...
Topics: Computer Vision and Pattern Recognition, Computing Research Repository
Source: http://arxiv.org/abs/1604.05383
3
3.0



by
Mouhacine Benosman; Jeff Borggaard; Boris Kramer
texts
eye 3
favorite 0
comment 0
We present some results on stabilization for reducedorder models (ROMs) of partial differential equations. The stabilization is achieved using Lyapunov theory to design a new closure model that is robust to parametric uncertainties. The free parameters in the proposed ROM stabilization method are optimized using a modelfree multiparametric extremum seeking (MES) algorithm. The 3D Boussinesq equations provide a challenging numerical testproblem that is used to demonstrate the advantages of...
Topics: Systems and Control, Numerical Analysis, Computing Research Repository, Mathematics
Source: http://arxiv.org/abs/1604.04586
3
3.0



by
Mattia Samory; Enoch Peserico
texts
eye 3
favorite 0
comment 0
This is the first work investigating community structure and interaction dynamics through the lens of quotes in online discussion forums. We examine four forums of different size, language, and topic. Quote usage, which is surprisingly consistent over time and users, appears to have an important role in aiding intrathread navigation, and uncovers a hidden "social" structure in communities otherwise lacking all trappings (from friends and followers to reputations) of today's social...
Topics: Computers and Society, Computing Research Repository, Social and Information Networks
Source: http://arxiv.org/abs/1604.04570
3
3.0



by
TsungHsien Wen; David Vandyke; Nikola Mrksic; Milica Gasic; Lina M. RojasBarahona; PeiHao Su; Stefan Ultes; Steve Young
texts
eye 3
favorite 0
comment 0
Teaching machines to accomplish tasks by conversing naturally with humans is challenging. Currently, developing taskoriented dialogue systems requires creating multiple components and typically this involves either a large amount of handcrafting, or acquiring costly labelled datasets to solve a statistical learning problem for each component. In this work we introduce a neural networkbased textin, textout endtoend trainable goaloriented dialogue system along with a new way of collecting...
Topics: Computation and Language, Machine Learning, Artificial Intelligence, Statistics, Neural and...
Source: http://arxiv.org/abs/1604.04562
2
2.0



by
Vahid Jamali; Nikola Zlatanov; Robert Schober
texts
eye 2
favorite 0
comment 0
We consider wireless backhauling for a scenario where two smallcell base stations (SCBSs) employ the same time and frequency resources for offloading their data to a common macrocell base station (MCBS). The two SCBSs allocate a part of the shared resource to exchange data in order to be able to cooperate to boost the backhaul capacity. For this scenario, we develop the optimal transmission strategy which, based on the channel state information, determines whether the SCBSs should...
Topics: Information Theory, Computing Research Repository, Mathematics
Source: http://arxiv.org/abs/1604.04567
5
5.0



by
Marcel Caria; Admela Jukan
texts
eye 5
favorite 0
comment 0
Link capacity dimensioning is the periodic task where ISPs have to make provisions for sudden traffic bursts and network failures to assure uninterrupted operations. This provision comes in the form of link working capacities with noticeable amounts of headroom, i.e., spare capacities that are used in case of congestions or network failures. Distributed routing protocols like OSPF provide convergence after network failures and have proven their reliable operation over decades, but require...
Topics: Networking and Internet Architecture, Computing Research Repository
Source: http://arxiv.org/abs/1604.05534
2
2.0



by
Arash Tavakoli; Haig Nalbandian; Nora Ayanian
texts
eye 2
favorite 0
comment 0
Humans have an impressive ability to solve complex coordination problems in a fully distributed manner. This ability, if learned as a set of distributed multirobot coordination strategies, can enable programming large groups of robots to collaborate towards complex coordination objectives in a way similar to humans. Such strategies would offer robustness, adaptability, faulttolerance, and, importantly, distributed decisionmaking. To that end, we have designed a networked gaming platform to...
Topics: Multiagent Systems, HumanComputer Interaction, Artificial Intelligence, Computing Research...
Source: http://arxiv.org/abs/1604.05942
2
2.0



by
GheorgheTeodor Bercea; Andrew T. T. McRae; David A. Ham; Lawrence Mitchell; Florian Rathgeber; Luigi Nardi; Fabio Luporini; Paul H. J. Kelly
texts
eye 2
favorite 0
comment 0
We present a generic algorithm for numbering and then efficiently iterating over the data values attached to an extruded mesh. An extruded mesh is formed by replicating an existing mesh, assumed to be unstructured, to form layers of prismatic cells. Applications of extruded meshes include, but are not limited to, the representation of 3D high aspect ratio domains employed by geophysical finite element simulations. These meshes are structured in the extruded direction. The algorithm presented...
Topics: Mathematical Software, Computing Research Repository
Source: http://arxiv.org/abs/1604.05937
3
3.0



by
Guilin Liu; Chao Yang; Zimo Li; Duygu Ceylan; Qixing Huang
texts
eye 3
favorite 0
comment 0
Due to the abundance of 2D product images from the Internet, developing efficient and scalable algorithms to recover the missing depth information is central to many applications. Recent works have addressed the singleview depth estimation problem by utilizing convolutional neural networks. In this paper, we show that exploring symmetry information, which is ubiquitous in man made objects, can significantly boost the quality of such depth predictions. Specifically, we propose a new...
Topics: Computer Vision and Pattern Recognition, Computing Research Repository
Source: http://arxiv.org/abs/1604.06079
2
2.0



by
Daniel S. Hono; Namrata Galatage; Kimberly A. Gero; Paliath Narendran; Ananya Subburathinam
texts
eye 2
favorite 0
comment 0
In this paper we investigate convergent term rewriting systems that conform to the criteria set out by Christopher Lynch and Barbara Morawska in their seminal paper "Basic Syntactic Mutation." The equational unification problem modulo such a rewrite system is solvable in polynomialtime. In this paper, we derive properties of such a system which we call an $LM$system. We show, in particular, that the rewrite rules in an $LM$system have no left or rightoverlaps. We also show that...
Topics: Logic in Computer Science, Computing Research Repository
Source: http://arxiv.org/abs/1604.06139
3
3.0



by
Sounak Dey; Anguelos Nicolaou; Josep Llados; Umapada Pal
texts
eye 3
favorite 0
comment 0
Word spotting is an important recognition task in historical document analysis. In most cases methods are developed and evaluated assuming perfect word segmentations. In this paper we propose an experimental framework to quantify the effect of goodness of word segmentation has on the performance achieved by word spotting methods in identical unbiased conditions. The framework consists of generating systematic distortions on segmentation and retrieving the original queries from the distorted...
Topics: Computer Vision and Pattern Recognition, Computing Research Repository
Source: http://arxiv.org/abs/1604.06243
3
3.0



by
Ernesto Brau; Colin Dawson; Alfredo Carrillo; David Sidi; Clayton T. Morrison
texts
eye 3
favorite 0
comment 0
We present a probabilistic generative model for inferring a description of coordinated, recursively structured group activities at multiple levels of temporal granularity based on observations of individuals' trajectories. The model accommodates: (1) hierarchically structured groups, (2) activities that are temporally and compositionally recursive, (3) component roles assigning different subactivity dynamics to subgroups of participants, and (4) a nonparametric Gaussian Process model of...
Topics: Computer Vision and Pattern Recognition, Artificial Intelligence, Computing Research Repository
Source: http://arxiv.org/abs/1604.06970
2
2.0



by
Kevin A. Lai; Anup B. Rao; Santosh Vempala
texts
eye 2
favorite 0
comment 0
We consider the problem of estimating the mean and covariance of a distribution from iid samples in $\mathbb{R}^n$, in the presence of an $\eta$ fraction of malicious noise; this is in contrast to much recent work where the noise itself is assumed to be from a distribution of known type. The agnostic problem includes many interesting special cases, e.g., learning the parameters of a single Gaussian (or finding the bestfit Gaussian) when $\eta$ fraction of data is adversarially corrupted,...
Topics: Machine Learning, Statistics, Data Structures and Algorithms, Computing Research Repository,...
Source: http://arxiv.org/abs/1604.06968
3
3.0



by
Yuri Suhov; Izabella Stuhl
texts
eye 3
favorite 0
comment 0
The Shannon Noiseless coding theorem (the datacompression principle) asserts that for an information source with an alphabet $\mathcal X=\{0,\ldots ,\ell 1\}$ and an asymptotic equipartition property, one can reduce the number of stored strings $(x_0,\ldots ,x_{n1})\in {\mathcal X}^n$ to $\ell^{nh}$ with an arbitrary small errorprobability. Here $h$ is the entropy rate of the source (calculated to the base $\ell$). We consider further reduction based on the concept of utility of a string...
Topics: Probability, Information Theory, Computing Research Repository, Mathematics
Source: http://arxiv.org/abs/1604.06971
3
3.0



by
Mika Göös; Rahul Jain; Thomas Watson
texts
eye 3
favorite 0
comment 0
We exhibit an $n$node graph whose independent set polytope requires extended formulations of size exponential in $\Omega(n/\log n)$. Previously, no explicit examples of $n$dimensional $0/1$polytopes were known with extension complexity larger than exponential in $\Theta(\sqrt{n})$. Our construction is inspired by a relatively littleknown connection between extended formulations and (monotone) circuit depth.
Topics: Discrete Mathematics, Combinatorics, Computational Complexity, Computing Research Repository,...
Source: http://arxiv.org/abs/1604.07062
2
2.0



by
Clemens Grabmayer
texts
eye 2
favorite 0
comment 0
Accattoli and Dal Lago have recently proved that the number of steps in a leftmostoutermost $\beta$reduction rewrite sequence to normal form provides an invariant cost model for the Lambda Calculus. They sketch how to implement leftmostoutermost $\beta$reduction rewrite sequences on a reasonable machine, with a polynomial overhead, by using simulating rewrite sequences in the linear explicit substitution calculus. I am interested in an implementation that demonstrates this result, but uses...
Topics: Logic in Computer Science, Computing Research Repository
Source: http://arxiv.org/abs/1604.07030
2
2.0



by
Antonio SzeTo; Hamid R. Tizhoosh; Andrew K. C. Wong
texts
eye 2
favorite 0
comment 0
A ContentBased Image Retrieval (CBIR) system which identifies similar medical images based on a query image can assist clinicians for more accurate diagnosis. The recent CBIR research trend favors the construction and use of binary codes to represent images. Deep architectures could learn the nonlinear relationship among image pixels adaptively, allowing the automatic learning of highlevel features from raw pixels. However, most of them require class labels, which are expensive to obtain,...
Topics: Computer Vision and Pattern Recognition, Computing Research Repository
Source: http://arxiv.org/abs/1604.07060
2
2.0



by
Andreas Emil Feldmann; Jochen Könemann; Kanstantsin Pashkovich; Laura Sanità
texts
eye 2
favorite 0
comment 0
In a standard $f$connectivity network design problem, we are given an undirected graph $G=(V,E)$, a cutrequirement function $f:2^V \rightarrow {\mathbb{N}}$, and nonnegative costs $c(e)$ for all $e \in E$. We are then asked to find a minimumcost vector $x \in {\mathbb{N}}^E$ such that $x(\delta(S)) \geq f(S)$ for all $S \subseteq V$. We focus on the class of such problems where $f$ is a proper function. This encodes many wellstudied NPhard problems such as the generalized survivable...
Topics: Data Structures and Algorithms, Discrete Mathematics, Mathematics, Optimization and Control,...
Source: http://arxiv.org/abs/1604.07049
3
3.0



by
Ruoyu Sun; Yinyu Ye
texts
eye 3
favorite 0
comment 0
This paper concerns the worstcase complexity of GaussSeidel method for solving a positive semidefinite linear system; or equivalently, that of cyclic coordinate descent (CCD) for minimizing a convex quadratic function. The known provable complexity of CCD can be $O(n)$ times slower than gradient descent (GD) and $O(n^2)$ times slower than randomized coordinate descent (RCD). However, these gaps seem rather puzzling since so far they have not been observed in practice; in fact, CCD...
Topics: Optimization and Control, Numerical Analysis, Computational Complexity, Computing Research...
Source: http://arxiv.org/abs/1604.07130
3
3.0



by
Muhammad Yousefnezhad; Daoqiang Zhang
texts
eye 3
favorite 0
comment 0
Clustering explores meaningful patterns in the nonlabeled data sets. Cluster Ensemble Selection (CES) is a new approach, which can combine individual clustering results for increasing the performance of the final results. Although CES can achieve better final results in comparison with individual clustering algorithms and cluster ensemble methods, its performance can be dramatically affected by its consensus diversity metric and thresholding procedure. There are two problems in CES: 1) most of...
Topics: Machine Learning, Statistics, Artificial Intelligence, Computing Research Repository, Learning
Source: http://arxiv.org/abs/1604.07178