10
10.0

Jun 25, 2018
06/18

by
Puneet Agarwal; Gautam Shroff; Sarmimala Saikia; Zaigham Khan

texts

######
eye 10

######
favorite 0

######
comment 0

While analyzing vehicular sensor data, we found that frequently occurring waveforms could serve as features for further analysis, such as rule mining, classification, and anomaly detection. The discovery of waveform patterns, also known as time-series motifs, has been studied extensively; however, available techniques for discovering frequently occurring time-series motifs were found lacking in either efficiency or quality: Standard subsequence clustering results in poor quality, to the extent...

Topics: Databases, Computing Research Repository, Learning, Computing Research Repository

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

10
10.0

Jun 25, 2018
06/18

by
Shai Ben-David

texts

######
eye 10

######
favorite 0

######
comment 0

It is well known that most of the common clustering objectives are NP-hard to optimize. In practice, however, clustering is being routinely carried out. One approach for providing theoretical understanding of this seeming discrepancy is to come up with notions of clusterability that distinguish realistically interesting input data from worst-case data sets. The hope is that there will be clustering algorithms that are provably efficient on such 'clusterable' instances. In other words, hope that...

Topics: Computational Complexity, Computing Research Repository, Learning, Computing Research Repository

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

15
15

Jun 25, 2018
06/18

by
Sang-Pil Kim; Myeong-Sun Gil; Yang-Sae Moon; Hee-Sun Won

texts

######
eye 15

######
favorite 0

######
comment 0

Secure similar document detection (SSDD) identifies similar documents of two parties while each party does not disclose its own sensitive documents to another party. In this paper, we propose an efficient 2-step protocol that exploits a feature selection as the lower-dimensional transformation and presents discriminative feature selections to maximize the performance of the protocol. For this, we first analyze that the existing 1-step protocol causes serious computation and communication...

Topics: Cryptography and Security, Computing Research Repository, Databases, Computing Research Repository

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

21
21

Jun 25, 2018
06/18

by
P. Mironchyk

texts

######
eye 21

######
favorite 0

######
comment 0

In experimental robotics, researchers may face uncertainties in parameters of a robot manipulator that they are working with. This uncertainty may be caused by deviations in the manufacturing process of a manipulator, or changes applied to manipulator in the lab for sake of experiments. Another situation when dynamical and inertial parameters of a robot are uncertain arises, is the grasping of objects by a manipulator. In all these situations there is a need for adaptive control strategies that...

Topics: Systems and Control, Computing Research Repository, Robotics, Computing Research Repository

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

3
3.0

Jun 25, 2018
06/18

by
Md. Jawaherul Alam; David Eppstein; Michael Kaufmann; Stephen G. Kobourov; Sergey Pupyrev; Andre Schulz; Torsten Ueckerdt

texts

######
eye 3

######
favorite 0

######
comment 0

We study representations of graphs by contacts of circular arcs, CCA-representations for short, where the vertices are interior-disjoint circular arcs in the plane and each edge is realized by an endpoint of one arc touching the interior of another. A graph is (2,k)-sparse if every s-vertex subgraph has at most 2s - k edges, and (2, k)-tight if in addition it has exactly 2n - k edges, where n is the number of vertices. Every graph with a CCA- representation is planar and (2, 0)-sparse, and it...

Topics: Computational Geometry, Computing Research Repository, Discrete Mathematics, Computing Research...

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

7
7.0

Jun 25, 2018
06/18

by
Md. Jawaherul Alam; William Evans; Stephen G. Kobourov; Sergey Pupyrev; Jackson Toeniskoetter; Torsten Ueckerdt

texts

######
eye 7

######
favorite 0

######
comment 0

We study contact representations of graphs in which vertices are represented by axis-aligned polyhedra in 3D and edges are realized by non-zero area common boundaries between corresponding polyhedra. We show that for every 3-connected planar graph, there exists a simultaneous representation of the graph and its dual with 3D boxes. We give a linear-time algorithm for constructing such a representation. This result extends the existing primal-dual contact representations of planar graphs in 2D...

Topics: Computational Geometry, Computing Research Repository, Discrete Mathematics, Computing Research...

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

7
7.0

Jun 28, 2018
06/18

by
Khalid Khan; D. K. Lobiyal; Adem Kilicman

texts

######
eye 7

######
favorite 0

######
comment 0

In this paper, a de Casteljau algorithm to compute (p,q)-Bernstein Bezier curves based on (p,q)-integers is introduced. We study the nature of degree elevation and degree reduction for (p,q)-Bezier Bernstein functions. The new curves have some properties similar to q-Bezier curves. Moreover, we construct the corresponding tensor product surfaces over the rectangular domain (u, v) \in [0, 1] \times [0, 1] depending on four parameters. We also study the de Casteljau algorithm and degree...

Topics: Computing Research Repository, Graphics

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

3
3.0

Jun 29, 2018
06/18

by
Andrei A. Rusu; Neil C. Rabinowitz; Guillaume Desjardins; Hubert Soyer; James Kirkpatrick; Koray Kavukcuoglu; Razvan Pascanu; Raia Hadsell

texts

######
eye 3

######
favorite 0

######
comment 0

Learning to solve complex sequences of tasks--while both leveraging transfer and avoiding catastrophic forgetting--remains a key obstacle to achieving human-level intelligence. The progressive networks approach represents a step forward in this direction: they are immune to forgetting and can leverage prior knowledge via lateral connections to previously learned features. We evaluate this architecture extensively on a wide variety of reinforcement learning tasks (Atari and 3D maze games), and...

Topics: Computing Research Repository, Learning

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

29
29

Jun 29, 2018
06/18

by
Shih-Chieh Su

texts

######
eye 29

######
favorite 0

######
comment 0

In this short paper, we propose the split-diffuse (SD) algorithm that takes the output of an existing word embedding algorithm, and distributes the data points uniformly across the visualization space. The result improves the perceivability and the interactability by the human. We apply the SD algorithm to analyze the user behavior through access logs within the cyber security domain. The result, named the topic grids, is a set of grids on various topics generated from the logs. On the same set...

Topics: Computing Research Repository, Learning

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

31
31

Jun 27, 2018
06/18

by
Alejandro Correa Bahnsen; Djamila Aouada; Bjorn Ottersten

texts

######
eye 31

######
favorite 0

######
comment 0

Several real-world classification problems are example-dependent cost-sensitive in nature, where the costs due to misclassification vary between examples and not only within classes. However, standard classification methods do not take these costs into account, and assume a constant cost of misclassification errors. In previous works, some methods that take into account the financial costs into the training of different algorithms have been proposed, with the example-dependent cost-sensitive...

Topics: Computing Research Repository, Learning

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

7
7.0

Jun 27, 2018
06/18

by
Zachary C. Lipton; Charles Elkan

texts

######
eye 7

######
favorite 0

######
comment 0

This paper presents an algorithm for efficient training of sparse linear models with elastic net regularization. Extending previous work on delayed updates, the new algorithm applies stochastic gradient updates to non-zero features only, bringing weights current as needed with closed-form updates. Closed-form delayed updates for the $\ell_1$, $\ell_{\infty}$, and rarely used $\ell_2$ regularizers have been described previously. This paper provides closed-form updates for the popular squared...

Topics: Computing Research Repository, Learning

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

10
10.0

Jun 25, 2018
06/18

by
Lee Zamparo; Zhaolei Zhang

texts

######
eye 10

######
favorite 0

######
comment 0

High-content screening uses large collections of unlabeled cell image data to reason about genetics or cell biology. Two important tasks are to identify those cells which bear interesting phenotypes, and to identify sub-populations enriched for these phenotypes. This exploratory data analysis usually involves dimensionality reduction followed by clustering, in the hope that clusters represent a phenotype. We propose the use of stacked de-noising auto-encoders to perform dimensionality reduction...

Topics: Learning, Computing Research Repository

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

7
7.0

Jun 28, 2018
06/18

by
Alexandra Carpentier; Alessandro Lazaric; Mohammad Ghavamzadeh; Rémi Munos; Peter Auer; András Antos

texts

######
eye 7

######
favorite 0

######
comment 0

In this paper, we study the problem of estimating uniformly well the mean values of several distributions given a finite budget of samples. If the variance of the distributions were known, one could design an optimal sampling strategy by collecting a number of independent samples per distribution that is proportional to their variance. However, in the more realistic case where the distributions are not known in advance, one needs to design adaptive sampling strategies in order to select which...

Topics: Computing Research Repository, Learning

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

3
3.0

Jun 29, 2018
06/18

by
Rajeev Rajan; Hema A. Murthy

texts

######
eye 3

######
favorite 0

######
comment 0

Phase processing has been replaced by group delay processing for the extraction of source and system parameters from speech. Group delay functions are ill-behaved when the transfer function has zeros that are close to unit circle in the z-domain. The modified group delay function addresses this problem and has been successfully used for formant and monopitch estimation. In this paper, modified group delay functions are used for multipitch estimation in concurrent speech. The power spectrum of...

Topics: Sound, Computing Research Repository

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

2
2.0

Jun 30, 2018
06/18

by
R. C. Nongpiur; D. J. Shpak

texts

######
eye 2

######
favorite 0

######
comment 0

A new method for designing non-uniform filter-banks for acoustic echo cancellation is proposed. In the method, the analysis prototype filter design is framed as a convex optimization problem that maximizes the signal-to-alias ratio (SAR) in the analysis banks. Since each sub-band has a different bandwidth, the contribution to the overall SAR from each analysis bank is taken into account during optimization. To increase the degrees of freedom during optimization, no constraints are imposed on...

Topics: Computing Research Repository, Sound

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

5
5.0

Jun 30, 2018
06/18

by
Nicholas Rotella; Michael Bloesch; Ludovic Righetti; Stefan Schaal

texts

######
eye 5

######
favorite 0

######
comment 0

This paper introduces a framework for state estimation on a humanoid robot platform using only common proprioceptive sensors and knowledge of leg kinematics. The presented approach extends that detailed in [1] on a quadruped platform by incorporating the rotational constraints imposed by the humanoid's flat feet. As in previous work, the proposed Extended Kalman Filter (EKF) accommodates contact switching and makes no assumptions about gait or terrain, making it applicable on any humanoid...

Topics: Robotics, Computing Research Repository

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

5
5.0

Jun 30, 2018
06/18

by
Huazi Zhang; Yichao Jin; Weiwen Zhang; Yonggang Wen

texts

######
eye 5

######
favorite 0

######
comment 0

Recently, multi-screen cloud social TV is invented to transform TV into social experience. People watching the same content on social TV may come from different locations, while freely interact with each other through text, image, audio and video. This crucial virtual living-room experience adds social aspects into existing performance metrics. In this paper, we parse social TV user experience into three elements (i.e., inter-user delay, video quality of experience (QoE), and resource...

Topics: Multimedia, Computing Research Repository

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

3
3.0

Jun 30, 2018
06/18

by
Georg Nawratil; Josef Schicho

texts

######
eye 3

######
favorite 0

######
comment 0

In this paper we give a full classification of all pentapods with mobility 2, where neither all platform anchor points nor all base anchor points are located on a line. Therefore this paper solves the famous Borel-Bricard problem for 2-dimensional motions beside the excluded case of five collinear points with spherical trajectories. But even for this special case we present three new types as a side-result. Based on our study of pentapods, we also give a complete list of all non-architecturally...

Topics: Robotics, Computing Research Repository

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

2
2.0

Jun 30, 2018
06/18

by
Paolo Missier; Simon Woodman; Hugo Hiden; Paul Watson

texts

######
eye 2

######
favorite 0

######
comment 0

One of the foundations of science is that researchers must publish the methodology used to achieve their results so that others can attempt to reproduce them. This has the added benefit of allowing methods to be adopted and adapted for other purposes. In the field of e-Science, services -- often choreographed through workflow, process data to generate results. The reproduction of results is often not straightforward as the computational objects may not be made available or may have been updated...

Topics: Databases, Computing Research Repository

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

2
2.0

Jun 30, 2018
06/18

by
Mark D. Reid; Rafael M. Frongillo; Robert C. Williamson; Nishant Mehta

texts

######
eye 2

######
favorite 0

######
comment 0

Mixability is a property of a loss which characterizes when fast convergence is possible in the game of prediction with expert advice. We show that a key property of mixability generalizes, and the exp and log operations present in the usual theory are not as special as one might have thought. In doing this we introduce a more general notion of $\Phi$-mixability where $\Phi$ is a general entropy (\ie, any convex function on probabilities). We show how a property shared by the convex dual of any...

Topics: Computing Research Repository, Learning

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

2
2.0

Jun 30, 2018
06/18

by
Richard Combes; Alexandre Proutiere

texts

######
eye 2

######
favorite 0

######
comment 0

We consider stochastic bandit problems with a continuous set of arms and where the expected reward is a continuous and unimodal function of the arm. No further assumption is made regarding the smoothness and the structure of the expected reward function. For these problems, we propose the Stochastic Pentachotomy (SP) algorithm, and derive finite-time upper bounds on its regret and optimization error. In particular, we show that, for any expected reward function $\mu$ that behaves as...

Topics: Computing Research Repository, Learning

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

3
3.0

Jun 30, 2018
06/18

by
Chris W. Muelder; Nick Leaf; Carmen Sigovan; Kwan-Liu Ma

texts

######
eye 3

######
favorite 0

######
comment 0

Analysis of high dimensional data is a common task. Often, small multiples are used to visualize 1 or 2 dimensions at a time, such as in a scatterplot matrix. Associating data points between different views can be difficult though, as the points are not fixed. Other times, dimensional reduction techniques are employed to summarize the whole dataset in one image, but individual dimensions are lost in this view. In this paper, we present a means of augmenting a dimensional reduction plot with...

Topics: Computing Research Repository, Graphics

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

3
3.0

Jun 30, 2018
06/18

by
Fariz Darari; Simon Razniewski; Werner Nutt

texts

######
eye 3

######
favorite 0

######
comment 0

RDF data is often treated as incomplete, following the Open-World Assumption. On the other hand, SPARQL, the standard query language over RDF, usually follows the Closed-World Assumption, assuming RDF data to be complete. This gives rise to a semantic gap between RDF and SPARQL. In this paper, we address how to close the semantic gap between RDF and SPARQL in terms of certain answers and possible answers using completeness statements.

Topics: Databases, Computing Research Repository

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

7
7.0

Jun 30, 2018
06/18

by
Xiufeng Liu

texts

######
eye 7

######
favorite 0

######
comment 0

Extract-Transform-Load (ETL) handles large amount of data and manages workload through dataflows. ETL dataflows are widely regarded as complex and expensive operations in terms of time and system resources. In order to minimize the time and the resources required by ETL dataflows, this paper presents a framework to optimize dataflows using shared cache and parallelization techniques. The framework classifies the components in an ETL dataflow into different categories based on their data...

Topics: Databases, Computing Research Repository

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

2
2.0

Jun 30, 2018
06/18

by
Ahmad Bilal Asghar; Stephen L. Smith

texts

######
eye 2

######
favorite 0

######
comment 0

In this paper we consider a robot patrolling problem in which events arrive randomly over time at the vertices of a graph. When an event arrives it remains active for a random amount of time. If that time active exceeds a certain threshold, then we say that the event is a true event; otherwise it is a false event. The robot(s) can traverse the graph to detect newly arrived events, and can revisit these events in order to classify them as true or false. The goal is to plan robot paths that...

Topics: Robotics, Computing Research Repository

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

2
2.0

Jun 30, 2018
06/18

by
Jiannan Wang; Guoliang Li; Tim Kraska; Michael J. Franklin; Jianhua Feng

texts

######
eye 2

######
favorite 0

######
comment 0

In the SIGMOD 2013 conference, we published a paper extending our earlier work on crowdsourced entity resolution to improve crowdsourced join processing by exploiting transitive relationships [Wang et al. 2013]. The VLDB 2014 conference has a paper that follows up on our previous work [Vesdapunt et al., 2014], which points out and corrects a mistake we made in our SIGMOD paper. Specifically, in Section 4.2 of our SIGMOD paper, we defined the "Expected Optimal Labeling Order" (EOLO)...

Topics: Databases, Computing Research Repository

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

3
3.0

Jun 30, 2018
06/18

by
Ting-Yu Ho; Yi-Nung Yeh; De-Nian Yang

texts

######
eye 3

######
favorite 0

######
comment 0

With the recent emergence of 3D-supported TVs, video service providers now face an opportunity to provide high resolution multi-view 3D videos over IP networks. One simple way to support efficient communications between a video server and multiple clients is to deliver each desired view in a multicast stream. Nevertheless, it is expected that significantly increased bandwidth will be required to support the transmission of all views in multi-view 3D videos. However, the recent emergence of a...

Topics: Multimedia, Computing Research Repository

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

2
2.0

Jun 30, 2018
06/18

by
Qingqing Huang; Rong Ge; Sham Kakade; Munther Dahleh

texts

######
eye 2

######
favorite 0

######
comment 0

Consider a stationary discrete random process with alphabet size d, which is assumed to be the output process of an unknown stationary Hidden Markov Model (HMM). Given the joint probabilities of finite length strings of the process, we are interested in finding a finite state generative model to describe the entire process. In particular, we focus on two classes of models: HMMs and quasi-HMMs, which is a strictly larger class of models containing HMMs. In the main theorem, we show that if the...

Topics: Computing Research Repository, Learning

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

3
3.0

Jun 30, 2018
06/18

by
Rui F. C. Guerreiro; Pedro M. Q. Aguiar

texts

######
eye 3

######
favorite 0

######
comment 0

The Discrete Cosine Transform (DCT) is widely used in lossy image and video compression schemes, e.g., JPEG and MPEG. In this paper, we show that the compression efficiency of the DCT is dependent on the edge directions within a block. In particular, higher compression ratios are achieved when edges are aligned with the image axes. To maximize compression for general images, we propose a rotated block DCT method. It consists of rotating each block, before applying the DCT, by an angle that...

Topics: Multimedia, Computing Research Repository

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

3
3.0

Jun 30, 2018
06/18

by
M. Praveen; B. Srivathsan

texts

######
eye 3

######
favorite 0

######
comment 0

Designing query languages for graph structured data is an active field of research. Evaluating a query on a graph results in a relation on the set of its nodes. In other words, a query is a mechanism for defining relations on a graph. Some relations may not be definable by any query in a given language. This leads to the following question: given a graph, a query language and a relation on the graph, does there exist a query in the language that defines the relation? This is called the...

Topics: Databases, Computing Research Repository

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

5
5.0

Jun 26, 2018
06/18

by
Ke Ji; Jianbiao Lin; Hui Li; Ao Wang; Tianjing Tang

texts

######
eye 5

######
favorite 0

######
comment 0

With the rapid development of the multimedia,the secure of the multimedia is get more concerned. as far as we know , Digital watermarking is an effective way to protect copyright. The watermark must be generally hidden does not affect the quality of the original image. In this paper,a novel way based on discrete cosine transform(DCT) and singular value decomposition(SVD) .In the proposed way,we decomposition the image into 8*8 blocks, next we use the DCT to get the transformed block,then we...

Topics: Multimedia, Computing Research Repository

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

5
5.0

Jun 27, 2018
06/18

by
V. N. Gorbachev; E. M. Kaynarova; I. K. Metelev; O. V. Pavlovskaya

texts

######
eye 5

######
favorite 0

######
comment 0

To hide a binary pattern in the palette image a steganographic scheme with blind detection is considered. The embedding algorithm uses the Lehmer code by palette color permutations for which the cover image palette is generally required. The found transformation between the palette and RGB images allows to extract the hidden data without any cover work.

Topics: Computing Research Repository, Multimedia

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

6
6.0

Jun 27, 2018
06/18

by
Khaled Fawagreh; Mohamad Medhat Gaber; Eyad Elyan

texts

######
eye 6

######
favorite 0

######
comment 0

Random Forest (RF) is an ensemble classification technique that was developed by Breiman over a decade ago. Compared with other ensemble techniques, it has proved its accuracy and superiority. Many researchers, however, believe that there is still room for enhancing and improving its performance in terms of predictive accuracy. This explains why, over the past decade, there have been many extensions of RF where each extension employed a variety of techniques and strategies to improve certain...

Topics: Learning, Computing Research Repository

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

2
2.0

Jun 29, 2018
06/18

by
Yingjun Wu; Wentian Guo; Chee-Yong Chan; Kian-Lee Tan

texts

######
eye 2

######
favorite 0

######
comment 0

Main-memory database management systems (DBMS) can achieve excellent performance when processing massive volume of on-line transactions on modern multi-core machines. But existing durability schemes, namely, tuple-level and transaction-level logging-and-recovery mechanisms, either degrade the performance of transaction processing or slow down the process of failure recovery. In this paper, we show that, by exploiting application semantics, it is possible to achieve speedy failure recovery...

Topics: Databases, Computing Research Repository

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

2
2.0

Jun 29, 2018
06/18

by
Teng Zhang; Zhi-Hua Zhou

texts

######
eye 2

######
favorite 0

######
comment 0

Support vector machine (SVM) has been one of the most popular learning algorithms, with the central idea of maximizing the minimum margin, i.e., the smallest distance from the instances to the classification boundary. Recent theoretical results, however, disclosed that maximizing the minimum margin does not necessarily lead to better generalization performances, and instead, the margin distribution has been proven to be more crucial. Based on this idea, we propose a new method, named Optimal...

Topics: Computing Research Repository, Learning

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

3
3.0

Jun 29, 2018
06/18

by
Tarique Siddiqui; Albert Kim; John Lee; Karrie Karahalios; Aditya Parameswaran

texts

######
eye 3

######
favorite 0

######
comment 0

Data visualization is by far the most commonly used mechanism to explore data, especially by novice data analysts and data scientists. And yet, current visual analytics tools are rather limited in their ability to guide data scientists to interesting or desired visualizations: the process of visual data exploration remains cumbersome and time-consuming. We propose zenvisage, a platform for effortlessly visualizing interesting patterns, trends, or insights from large datasets. We describe...

Topics: Databases, Computing Research Repository

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

3
3.0

Jun 29, 2018
06/18

by
Miron Bartosz Kursa

texts

######
eye 3

######
favorite 0

######
comment 0

Many machine learning methods can produce variable importance scores expressing the usability of each feature in context of the produced model; those scores on their own are yet not sufficient to generate feature selection, especially when an all relevant selection is required. Although there are wrapper methods aiming to solve this problem, they introduce a substantial increase in the required computational effort. In this paper I investigate an idea of incorporating all relevant selection...

Topics: Computing Research Repository, Learning

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

4
4.0

Jun 29, 2018
06/18

by
Timothy J. O'Shea; Johnathan Corgan; T. Charles Clancy

texts

######
eye 4

######
favorite 0

######
comment 0

We explore unsupervised representation learning of radio communication signals in raw sampled time series representation. We demonstrate that we can learn modulation basis functions using convolutional autoencoders and visually recognize their relationship to the analytic bases used in digital communications. We also propose and evaluate quantitative met- rics for quality of encoding using domain relevant performance metrics.

Topics: Computing Research Repository, Learning

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

2
2.0

Jun 29, 2018
06/18

by
Wouter M. Koolen; Peter Grünwald; Tim van Erven

texts

######
eye 2

######
favorite 0

######
comment 0

We consider online learning algorithms that guarantee worst-case regret rates in adversarial environments (so they can be deployed safely and will perform robustly), yet adapt optimally to favorable stochastic environments (so they will perform well in a variety of settings of practical importance). We quantify the friendliness of stochastic environments by means of the well-known Bernstein (a.k.a. generalized Tsybakov margin) condition. For two recent algorithms (Squint for the Hedge setting...

Topics: Computing Research Repository, Learning

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

2
2.0

Jun 29, 2018
06/18

by
Andrei Lopatenko; Leopoldo Bertossi

texts

######
eye 2

######
favorite 0

######
comment 0

A database D may be inconsistent wrt a given set IC of integrity constraints. Consistent Query Answering (CQA) is the problem of computing from D the answers to a query that are consistent wrt IC . Consistent answers are invariant under all the repairs of D, i.e. the consistent instances that minimally depart from D. Three classes of repair have been considered in the literature: those that minimize set-theoretically the set of tuples in the symmetric difference; those that minimize the changes...

Topics: Databases, Computing Research Repository

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

2
2.0

Jun 29, 2018
06/18

by
Vladimir Vovk; Dusko Pavlovic

texts

######
eye 2

######
favorite 0

######
comment 0

We construct universal prediction systems in the spirit of Popper's falsifiability and Kolmogorov complexity and randomness. These prediction systems do not depend on any statistical assumptions (but under the IID assumption they dominate, to within the usual accuracy, conformal prediction). Our constructions give rise to a theory of algorithmic complexity and randomness of time containing analogues of several notions and results of the classical theory of Kolmogorov complexity and randomness.

Topics: Computing Research Repository, Learning

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

14
14

Jun 29, 2018
06/18

by
Stefano Ferretti

texts

######
eye 14

######
favorite 0

######
comment 0

This paper presents an approach to model melodies (and music pieces in general) as networks. Notes of a melody can be seen as nodes of a network that are connected whenever these are played in sequence. This creates a directed graph. By using complex network theory, it is possible to extract some main metrics, typical of networks, that characterize the piece. Using this framework, we provide an analysis on a set of guitar solos performed by main musicians. The results of this study indicate...

Topics: Sound, Computing Research Repository

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

2
2.0

Jun 29, 2018
06/18

by
Jean-Marc Valin; Jean Rouat; François Michaud

texts

######
eye 2

######
favorite 0

######
comment 0

Microphone array post-filters have demonstrated their ability to greatly reduce noise at the output of a beamformer. However, current techniques only consider a single source of interest, most of the time assuming stationary background noise. We propose a microphone array post-filter that enhances the signals produced by the separation of simultaneous sources using common source separation algorithms. Our method is based on a loudness-domain optimal spectral estimator and on the assumption that...

Topics: Sound, Computing Research Repository

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

3
3.0

Jun 29, 2018
06/18

by
Panagiotis Bouros; Nikos Mamoulis; Shen Ge; Manolis Terrovitis

texts

######
eye 3

######
favorite 0

######
comment 0

Given two collections of set objects $R$ and $S$, the $R \bowtie_{\subseteq} S$ set containment join returns all object pairs $(r, s) \in R \times S$ such that $r \subseteq s$. Besides being a basic operator in all modern data management systems with a wide range of applications, the join can be used to evaluate complex SQL queries based on relational division and as a module of data mining algorithms. The state-of-the-art algorithm for set containment joins (PRETTI) builds an inverted index on...

Topics: Databases, Computing Research Repository

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

2
2.0

Jun 30, 2018
06/18

by
Matteo Lasagni; Kay Römer

texts

######
eye 2

######
favorite 0

######
comment 0

We present design and implementation of a chain of particles that can be programmed to fold the chain into a given curve. The particles guide an external force to fold, therefore the particles are simple and amenable for miniaturization. A chain can consist of a large number of such particles. Using multiple of these chains, a shape-shifting display can be constructed that folds its initially flat surface to approximate a given 3D shape that can be touched and modified by users, for example,...

Topics: Robotics, Computing Research Repository

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

3
3.0

Jun 30, 2018
06/18

by
Pinar Yanardag; S. V. N. Vishwanathan

texts

######
eye 3

######
favorite 0

######
comment 0

A commonly used paradigm for representing graphs is to use a vector that contains normalized frequencies of occurrence of certain motifs or sub-graphs. This vector representation can be used in a variety of applications, such as, for computing similarity between graphs. The graphlet kernel of Shervashidze et al. [32] uses induced sub-graphs of k nodes (christened as graphlets by Przulj [28]) as motifs in the vector representation, and computes the kernel via a dot product between these vectors....

Topics: Computing Research Repository, Learning

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

3
3.0

Jun 30, 2018
06/18

by
Minhao Jiang; Ada Wai-Chee Fu; Raymond Chi-Wing Wong; Yanyan Xu

texts

######
eye 3

######
favorite 0

######
comment 0

We study the problem of point-to-point distance querying for massive scale-free graphs, which is important for numerous applications. Given a directed or undirected graph, we propose to build an index for answering such queries based on a hop-doubling labeling technique. We derive bounds on the index size, the computation costs and I/O costs based on the properties of unweighted scale-free graphs. We show that our method is much more efficient compared to the state-of-the-art technique, in...

Topics: Databases, Computing Research Repository

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

2
2.0

Jun 30, 2018
06/18

by
Edward Schmerling; Lucas Janson; Marco Pavone

texts

######
eye 2

######
favorite 0

######
comment 0

Motion planning under differential constraints is a classic problem in robotics. To date, the state of the art is represented by sampling-based techniques, with the Rapidly-exploring Random Tree algorithm as a leading example. Yet, the problem is still open in many aspects, including guarantees on the quality of the obtained solution. In this paper we provide a thorough theoretical framework to assess optimality guarantees of sampling-based algorithms for planning under differential...

Topics: Robotics, Computing Research Repository

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

2
2.0

Jun 30, 2018
06/18

by
Guillaume Rabusseau; François Denis

texts

######
eye 2

######
favorite 0

######
comment 0

This work considers the problem of estimating the parameters of negative mixture models, i.e. mixture models that possibly involve negative weights. The contributions of this paper are as follows. (i) We show that every rational probability distributions on strings, a representation which occurs naturally in spectral learning, can be computed by a negative mixture of at most two probabilistic automata (or HMMs). (ii) We propose a method to estimate the parameters of negative mixture models...

Topics: Computing Research Repository, Learning

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

3
3.0

Jun 30, 2018
06/18

by
Debarghya Ghoshdastidar; Ambedkar Dukkipati; Ajay P. Adsul; Aparna S. Vijayan

texts

######
eye 3

######
favorite 0

######
comment 0

Motivated by multi-distribution divergences, which originate in information theory, we propose a notion of `multi-point' kernels, and study their applications. We study a class of kernels based on Jensen type divergences and show that these can be extended to measure similarity among multiple points. We study tensor flattening methods and develop a multi-point (kernel) spectral clustering (MSC) method. We further emphasize on a special case of the proposed kernels, which is a multi-point...

Topics: Computing Research Repository, Learning

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