doc_id
string
arxiv_id
string
title
string
text
string
url
string
doi
string
category
string
published
string
era
string
dendro_not_after
string
dendro_not_after_year
int64
dendro_human_origin_p
float64
dendro_ci_low
float64
dendro_ci_high
float64
dendro_abstained
bool
dendro_operators
int64
dendro_evidence_logodds
float64
dendro_flags
list
dendro_ancestor
null
dendro_explanation
string
low_background
bool
arxiv:1809.02052
1809.02052
Eigenvalue analogy for confidence estimation in item-based recommender systems
Eigenvalue analogy for confidence estimation in item-based recommender systems Item-item collaborative filtering (CF) models are a well known and studied family of recommender systems, however current literature does not provide any theoretical explanation of the conditions under which item-based recommendations will ...
https://arxiv.org/abs/1809.02052
null
cs.IR
2018-10-29T00:00:00+00:00
pre2021
2018-10-29
2,018
0.994408
0.850269
0.996364
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2018-10-29, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.5% of ...
true
arxiv:1809.04556
1809.04556
Unsupervised Controllable Text Formalization
Unsupervised Controllable Text Formalization We propose a novel framework for controllable natural language transformation. Realizing that the requirement of parallel corpus is practically unsustainable for controllable generation tasks, an unsupervised training scheme is introduced. The crux of the framework is a dee...
https://arxiv.org/abs/1809.04556
null
cs.CL
2019-02-20T00:00:00+00:00
pre2021
2019-02-20
2,019
0.993925
0.849503
0.996266
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2019-02-20, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.5% of ...
true
arxiv:1809.09237
1809.09237
Nonconvex Robust Low-rank Matrix Recovery
Nonconvex Robust Low-rank Matrix Recovery In this paper we study the problem of recovering a low-rank matrix from a number of random linear measurements that are corrupted by outliers taking arbitrary values. We consider a nonsmooth nonconvex formulation of the problem, in which we explicitly enforce the low-rank prop...
https://arxiv.org/abs/1809.09237
null
cs.IT
2019-07-14T00:00:00+00:00
pre2021
2019-07-14
2,019
0.992942
0.847948
0.996062
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2019-07-14, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.6% of ...
true
arxiv:1809.10482
1809.10482
Budgeted Multi-Objective Optimization with a Focus on the Central Part of the Pareto Front -- Extended Version
Budgeted Multi-Objective Optimization with a Focus on the Central Part of the Pareto Front -- Extended Version Optimizing nonlinear systems involving expensive computer experiments with regard to conflicting objectives is a common challenge. When the number of experiments is severely restricted and/or when the number ...
https://arxiv.org/abs/1809.10482
null
stat.ML
2019-07-15T00:00:00+00:00
pre2021
2019-07-15
2,019
0.992933
0.847934
0.99606
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2019-07-15, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.6% of ...
true
arxiv:1810.00846
1810.00846
Classification from Positive, Unlabeled and Biased Negative Data
Classification from Positive, Unlabeled and Biased Negative Data In binary classification, there are situations where negative (N) data are too diverse to be fully labeled and we often resort to positive-unlabeled (PU) learning in these scenarios. However, collecting a non-representative N set that contains only a sma...
https://arxiv.org/abs/1810.00846
null
cs.LG
2019-07-13T00:00:00+00:00
pre2021
2019-07-13
2,019
0.992951
0.847962
0.996064
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2019-07-13, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.6% of ...
true
arxiv:1810.07117
1810.07117
Universal Uhrig dynamical decoupling for bosonic systems
Universal Uhrig dynamical decoupling for bosonic systems We construct efficient deterministic dynamical decoupling schemes protecting continuous variable degrees of freedom. Our schemes target decoherence induced by quadratic system-bath interactions with analytic time-dependence. We show how to suppress such interact...
https://arxiv.org/abs/1810.07117
10.1103/PhysRevLett.123.010501
quant-ph
2019-04-02T00:00:00+00:00
pre2021
2019-04-02
2,019
0.993696
0.84914
0.996219
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2019-04-02, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.6% of ...
true
arxiv:1811.00250
1811.00250
Filter Pruning via Geometric Median for Deep Convolutional Neural Networks Acceleration
Filter Pruning via Geometric Median for Deep Convolutional Neural Networks Acceleration Previous works utilized ''smaller-norm-less-important'' criterion to prune filters with smaller norm values in a convolutional neural network. In this paper, we analyze this norm-based criterion and point out that its effectiveness...
https://arxiv.org/abs/1811.00250
null
cs.CV
2019-07-14T00:00:00+00:00
pre2021
2019-07-14
2,019
0.992942
0.847948
0.996062
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2019-07-14, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.6% of ...
true
arxiv:1404.1678
1404.1678
Two CSCS-based iteration methods for solving absolute value equations
Two CSCS-based iteration methods for solving absolute value equations Recently, two families of HSS-based iteration methods are constructed for solving the system of absolute value equations (AVEs), which is a class of non-differentiable NP-hard problems. In this study, we establish the Picard-CSCS iteration method an...
https://arxiv.org/abs/1404.1678
10.11948/2017082
math.NA
2020-01-13T00:00:00+00:00
pre2021
2020-01-13
2,020
0.990655
0.844363
0.995569
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2020-01-13, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.9% of ...
true
arxiv:1412.7276
1412.7276
A Framework for a Smart Social Blood Donation System Based on Mobile Cloud Computing
A Framework for a Smart Social Blood Donation System Based on Mobile Cloud Computing Blood Donation and Blood Transfusion Services (BTS) are crucial for saving people lives. Recently, worldwide efforts have been undertaken to utilize social media and smartphone applications to make the blood donation process more conv...
https://arxiv.org/abs/1412.7276
null
cs.CY
2019-04-08T00:00:00+00:00
pre2021
2019-04-08
2,019
0.99366
0.849082
0.996211
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2019-04-08, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.6% of ...
true
arxiv:1511.07568
1511.07568
Multi-Cell Multiuser Massive MIMO Networks: User Capacity Analysis and Pilot Design
Multi-Cell Multiuser Massive MIMO Networks: User Capacity Analysis and Pilot Design We propose a novel pilot sequence design to mitigate pilot contamination in multi-cell multiuser massive multiple-input multiple-output networks. Our proposed design generates pilot sequences in the multi-cell network and devises power...
https://arxiv.org/abs/1511.07568
10.1109/TCOMM.2016.2614674
cs.IT
2016-09-28T00:00:00+00:00
pre2021
2016-09-28
2,016
0.995276
0.851652
0.996537
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2016-09-28, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.4% of ...
true
arxiv:1512.03921
1512.03921
SharesSkew: An Algorithm to Handle Skew for Joins in MapReduce
SharesSkew: An Algorithm to Handle Skew for Joins in MapReduce In this paper, we investigate the problem of computing a multiway join in one round of MapReduce when the data may be skewed. We optimize on communication cost, i.e., the amount of data that is transferred from the mappers to the reducers. We identify join...
https://arxiv.org/abs/1512.03921
10.1016/j.is.2018.06.005
cs.DB
2015-12-12T00:00:00+00:00
pre2021
2015-12-12
2,015
0.995312
0.85171
0.996544
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2015-12-12, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.4% of ...
true
arxiv:1603.05629
1603.05629
Discriminative Embeddings of Latent Variable Models for Structured Data
Discriminative Embeddings of Latent Variable Models for Structured Data Kernel classifiers and regressors designed for structured data, such as sequences, trees and graphs, have significantly advanced a number of interdisciplinary areas such as computational biology and drug design. Typically, kernels are designed bef...
https://arxiv.org/abs/1603.05629
null
cs.LG
2020-01-11T00:00:00+00:00
pre2021
2020-01-11
2,020
0.990689
0.844416
0.995576
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2020-01-11, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.9% of ...
true
arxiv:1607.03944
1607.03944
Formulation and convergence of the finite volume method for conservation laws on spacetimes with boundary
Formulation and convergence of the finite volume method for conservation laws on spacetimes with boundary We study nonlinear hyperbolic conservation laws posed on a differential (n+1)-manifold with boundary referred to as a spacetime, and defined from a prescribed flux field of n-forms depending on a parameter (the un...
https://arxiv.org/abs/1607.03944
null
math.AP
2020-01-13T00:00:00+00:00
pre2021
2020-01-13
2,020
0.990655
0.844363
0.995569
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2020-01-13, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.9% of ...
true
arxiv:1607.06540
1607.06540
User Load Analysis and Pilot Sequence Design for Multi-Cell Massive MIMO Networks
User Load Analysis and Pilot Sequence Design for Multi-Cell Massive MIMO Networks We propose a novel algorithm to design user load-achieving pilot sequences that mitigate pilot contamination in multi-cell massive multiple-input multiple-output (MIMO) networks. To this end, we first derive expressions for the user load...
https://arxiv.org/abs/1607.06540
10.1109/GLOCOM.2016.7842365
cs.IT
2016-11-16T00:00:00+00:00
pre2021
2016-11-16
2,016
0.995265
0.851634
0.996535
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2016-11-16, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.4% of ...
true
arxiv:1609.06954
1609.06954
Semiring Programming: A Declarative Framework for Generalized Sum Product Problems
Semiring Programming: A Declarative Framework for Generalized Sum Product Problems To solve hard problems, AI relies on a variety of disciplines such as logic, probabilistic reasoning, machine learning and mathematical programming. Although it is widely accepted that solving real-world problems requires an integration...
https://arxiv.org/abs/1609.06954
null
cs.AI
2020-01-13T00:00:00+00:00
pre2021
2020-01-13
2,020
0.990655
0.844363
0.995569
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2020-01-13, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.9% of ...
true
arxiv:1609.08787
1609.08787
Mitigating Pilot Contamination Through Location-Aware Pilot Assignment in Massive MIMO Networks
Mitigating Pilot Contamination Through Location-Aware Pilot Assignment in Massive MIMO Networks We propose a novel location-aware pilot assignment scheme to mitigate pilot contamination in massive multiple-input multiple-output (MIMO) networks, where the channels are subjected to Rician fading. Our proposed scheme uti...
https://arxiv.org/abs/1609.08787
10.1109/GLOCOMW.2016.7848962
cs.IT
2016-09-28T00:00:00+00:00
pre2021
2016-09-28
2,016
0.995276
0.851652
0.996537
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2016-09-28, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.4% of ...
true
arxiv:1705.06769
1705.06769
Feature Control as Intrinsic Motivation for Hierarchical Reinforcement Learning
Feature Control as Intrinsic Motivation for Hierarchical Reinforcement Learning The problem of sparse rewards is one of the hardest challenges in contemporary reinforcement learning. Hierarchical reinforcement learning (HRL) tackles this problem by using a set of temporally-extended actions, or options, each of which ...
https://arxiv.org/abs/1705.06769
10.1109/TNNLS.2019.2891792
cs.LG
2017-11-22T00:00:00+00:00
pre2021
2017-11-22
2,017
0.995069
0.851322
0.996496
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2017-11-22, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.4% of ...
true
arxiv:1710.02380
1710.02380
Active Attack on User Load Achieving Pilot Design in Massive MIMO Networks
Active Attack on User Load Achieving Pilot Design in Massive MIMO Networks In this paper, we propose an active attacking strategy on a massive multiple-input multiple-output (MIMO) network, where the pilot sequences are obtained using the user load-achieving pilot sequence design. The user load-achieving design ensure...
https://arxiv.org/abs/1710.02380
10.1109/GLOCOMW.2017.8269223
cs.IT
2017-10-06T00:00:00+00:00
pre2021
2017-10-06
2,017
0.995111
0.851389
0.996504
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2017-10-06, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.4% of ...
true
arxiv:1710.07702
1710.07702
On the Consistency of Graph-based Bayesian Learning and the Scalability of Sampling Algorithms
On the Consistency of Graph-based Bayesian Learning and the Scalability of Sampling Algorithms A popular approach to semi-supervised learning proceeds by endowing the input data with a graph structure in order to extract geometric information and incorporate it into a Bayesian framework. We introduce new theory that g...
https://arxiv.org/abs/1710.07702
null
stat.ML
2020-01-12T00:00:00+00:00
pre2021
2020-01-12
2,020
0.990672
0.844389
0.995573
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2020-01-12, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.9% of ...
true
arxiv:1712.04429
1712.04429
Machine Learning simulates Agent-Based Model
Machine Learning simulates Agent-Based Model Running agent-based models (ABMs) is a burdensome computational task, specially so when considering the flexibility ABMs intrinsically provide. This paper uses a bundle of model configuration parameters along with obtained results from a validated ABM to train some Machine ...
https://arxiv.org/abs/1712.04429
null
cs.MA
2020-01-13T00:00:00+00:00
pre2021
2020-01-13
2,020
0.990655
0.844363
0.995569
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2020-01-13, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.9% of ...
true
arxiv:1712.05548
1712.05548
Persistent Homology Guided Force-Directed Graph Layouts
Persistent Homology Guided Force-Directed Graph Layouts Graphs are commonly used to encode relationships among entities, yet their abstractness makes them difficult to analyze. Node-link diagrams are popular for drawing graphs, and force-directed layouts provide a flexible method for node arrangements that use local r...
https://arxiv.org/abs/1712.05548
10.1109/TVCG.2019.2934802
cs.GR
2019-10-04T00:00:00+00:00
pre2021
2019-10-04
2,019
0.992102
0.846626
0.995884
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2019-10-04, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.7% of ...
true
arxiv:1801.07862
1801.07862
Downlink Power Control in Massive MIMO Networks with Distributed Antenna Arrays
Downlink Power Control in Massive MIMO Networks with Distributed Antenna Arrays In this paper, we investigate downlink power control in massive multiple-input multiple-output (MIMO) networks with distributed antenna arrays. The base station (BS) in each cell consists of multiple antenna arrays, which are deployed in a...
https://arxiv.org/abs/1801.07862
10.1109/ICC.2018.8422458
cs.IT
2018-03-13T00:00:00+00:00
pre2021
2018-03-13
2,018
0.994936
0.851111
0.99647
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2018-03-13, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.4% of ...
true
arxiv:1801.09282
1801.09282
Spectral Shape Preserving Approximation
Spectral Shape Preserving Approximation We introduce an algorithm of joint approximation of a function and its first derivative by alternative orthogonal polynomials on the interval [0,1].The algorithm exhibits properties of shape preserving approximation for the function. A weak formulation of approximation is presen...
https://arxiv.org/abs/1801.09282
null
math.NA
2020-01-11T00:00:00+00:00
pre2021
2020-01-11
2,020
0.990689
0.844416
0.995576
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2020-01-11, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.9% of ...
true
arxiv:1803.00355
1803.00355
Learning-based Dynamic Pinning of Parallelized Applications in Many-Core Systems
Learning-based Dynamic Pinning of Parallelized Applications in Many-Core Systems Motivated by the need for adaptive, secure and responsive scheduling in a great range of computing applications, including human-centered and time-critical applications, this paper proposes a scheduling framework that seamlessly adds reso...
https://arxiv.org/abs/1803.00355
null
cs.DC
2020-01-11T00:00:00+00:00
pre2021
2020-01-11
2,020
0.990689
0.844416
0.995576
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2020-01-11, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.9% of ...
true
arxiv:1803.04523
1803.04523
Event-based Moving Object Detection and Tracking
Event-based Moving Object Detection and Tracking Event-based vision sensors, such as the Dynamic Vision Sensor (DVS), are ideally suited for real-time motion analysis. The unique properties encompassed in the readings of such sensors provide high temporal resolution, superior sensitivity to light and low latency. Thes...
https://arxiv.org/abs/1803.04523
10.1109/IROS.2018.8593805
cs.CV
2020-01-12T00:00:00+00:00
pre2021
2020-01-12
2,020
0.990672
0.844389
0.995573
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2020-01-12, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.9% of ...
true
arxiv:1804.08130
1804.08130
Sparse Travel Time Estimation from Streaming Data
Sparse Travel Time Estimation from Streaming Data We address two shortcomings in online travel time estimation methods for congested urban traffic. The first shortcoming is related to the determination of the number of mixture modes, which can change dynamically, within day and from day to day. The second shortcoming ...
https://arxiv.org/abs/1804.08130
10.1287/trsc.2019.0920
stat.ML
2019-05-13T00:00:00+00:00
pre2021
2019-05-13
2,019
0.99343
0.848718
0.996164
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2019-05-13, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.6% of ...
true
arxiv:1804.09841
1804.09841
Location-Aware Pilot Allocation in Multi-Cell Multi-User Massive MIMO Networks
Location-Aware Pilot Allocation in Multi-Cell Multi-User Massive MIMO Networks We propose a location-aware pilot allocation algorithm for a massive multiple-input multiple-output (MIMO) network with high-mobility users, where the wireless channels are subject to Rician fading. Pilot allocation in massive MIMO is a har...
https://arxiv.org/abs/1804.09841
10.1109/TVT.2018.2831224
cs.IT
2018-04-27T00:00:00+00:00
pre2021
2018-04-27
2,018
0.994865
0.850997
0.996455
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2018-04-27, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.4% of ...
true
arxiv:1805.02457
1805.02457
$(Δ+1)$ Coloring in the Congested Clique Model
$(Δ+1)$ Coloring in the Congested Clique Model In this paper, we present improved algorithms for the $(Δ+1)$ (vertex) coloring problem in the Congested-Clique model of distributed computing. In this model, the input is a graph on $n$ nodes, initially each node knows only its incident edges, and per round each two no...
https://arxiv.org/abs/1805.02457
null
cs.DS
2020-01-12T00:00:00+00:00
pre2021
2020-01-12
2,020
0.990672
0.844389
0.995573
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2020-01-12, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.9% of ...
true
arxiv:1806.03916
1806.03916
A Survey on Trust Modeling from a Bayesian Perspective
A Survey on Trust Modeling from a Bayesian Perspective In this paper, we are concerned with trust modeling for agents in networked computing systems. As trust is a subjective notion that is invisible, implicit and uncertain in nature, many attempts have been made to model trust with aid of Bayesian probability theory,...
https://arxiv.org/abs/1806.03916
null
cs.CR
2020-01-11T00:00:00+00:00
pre2021
2020-01-11
2,020
0.990689
0.844416
0.995576
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2020-01-11, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.9% of ...
true
arxiv:1807.01162
1807.01162
Reverse Prevention Sampling for Misinformation Mitigation in Social Networks
Reverse Prevention Sampling for Misinformation Mitigation in Social Networks In this work, we consider misinformation propagating through a social network and study the problem of its prevention. In this problem, a "bad" campaign starts propagating from a set of seed nodes in the network and we use the notion of a lim...
https://arxiv.org/abs/1807.01162
null
cs.SI
2020-01-13T00:00:00+00:00
pre2021
2020-01-13
2,020
0.990655
0.844363
0.995569
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2020-01-13, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.9% of ...
true
arxiv:1807.04912
1807.04912
Perceptrons from Memristors
Perceptrons from Memristors Memristors, resistors with memory whose outputs depend on the history of their inputs, have been used with success in neuromorphic architectures, particularly as synapses and non-volatile memories. However, to the best of our knowledge, no model for a network in which both the synapses and ...
https://arxiv.org/abs/1807.04912
10.1016/j.neunet.2019.10.013
cs.ET
2018-12-26T00:00:00+00:00
pre2021
2018-12-26
2,018
0.994188
0.849919
0.996319
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2018-12-26, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.5% of ...
true
arxiv:1807.06736
1807.06736
Forward Attention in Sequence-to-sequence Acoustic Modelling for Speech Synthesis
Forward Attention in Sequence-to-sequence Acoustic Modelling for Speech Synthesis This paper proposes a forward attention method for the sequenceto- sequence acoustic modeling of speech synthesis. This method is motivated by the nature of the monotonic alignment from phone sequences to acoustic sequences. Only the ali...
https://arxiv.org/abs/1807.06736
10.1109/ICASSP.2018.8462020
cs.CL
2018-07-18T00:00:00+00:00
pre2021
2018-07-18
2,018
0.9947
0.850734
0.996422
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2018-07-18, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.5% of ...
true
arxiv:1810.02434
1810.02434
Abstracting Probabilistic Models: A Logical Perspective
Abstracting Probabilistic Models: A Logical Perspective Abstraction is a powerful idea widely used in science, to model, reason and explain the behavior of systems in a more tractable search space, by omitting irrelevant details. While notions of abstraction have matured for deterministic systems, the case for abstrac...
https://arxiv.org/abs/1810.02434
null
cs.AI
2020-01-13T00:00:00+00:00
pre2021
2020-01-13
2,020
0.990655
0.844363
0.995569
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2020-01-13, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.9% of ...
true
arxiv:1810.06865
1810.06865
Sequence-to-Sequence Acoustic Modeling for Voice Conversion
Sequence-to-Sequence Acoustic Modeling for Voice Conversion In this paper, a neural network named Sequence-to-sequence ConvErsion NeTwork (SCENT) is presented for acoustic modeling in voice conversion. At training stage, a SCENT model is estimated by aligning the feature sequences of source and target speakers implici...
https://arxiv.org/abs/1810.06865
10.1109/TASLP.2019.2892235
cs.SD
2020-01-12T00:00:00+00:00
pre2021
2020-01-12
2,020
0.990672
0.844389
0.995573
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2020-01-12, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.9% of ...
true
arxiv:1810.10109
1810.10109
Et Tu Alexa? When Commodity WiFi Devices Turn into Adversarial Motion Sensors
Et Tu Alexa? When Commodity WiFi Devices Turn into Adversarial Motion Sensors Our work demonstrates a new set of silent reconnaissance attacks, which leverages the presence of commodity WiFi devices to track users inside private homes and offices, without compromising any WiFi network, data packets, or devices. We sho...
https://arxiv.org/abs/1810.10109
10.14722/ndss.2020.23053
cs.CR
2020-01-11T00:00:00+00:00
pre2021
2020-01-11
2,020
0.990689
0.844416
0.995576
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2020-01-11, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.9% of ...
true
arxiv:1810.11702
1810.11702
Multi-Agent Common Knowledge Reinforcement Learning
Multi-Agent Common Knowledge Reinforcement Learning Cooperative multi-agent reinforcement learning often requires decentralised policies, which severely limit the agents' ability to coordinate their behaviour. In this paper, we show that common knowledge between agents allows for complex decentralised coordination. Co...
https://arxiv.org/abs/1810.11702
null
cs.MA
2020-01-11T00:00:00+00:00
pre2021
2020-01-11
2,020
0.990689
0.844416
0.995576
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2020-01-11, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.9% of ...
true
arxiv:1811.04748
1811.04748
Expectation-Maximization for Adaptive Mixture Models in Graph Optimization
Expectation-Maximization for Adaptive Mixture Models in Graph Optimization Non-Gaussian and multimodal distributions are an important part of many recent robust sensor fusion algorithms. In difference to robust cost functions, they are probabilistically founded and have good convergence properties. Since their robustn...
https://arxiv.org/abs/1811.04748
10.1109/ICRA.2019.8793601
cs.RO
2020-01-13T00:00:00+00:00
pre2021
2020-01-13
2,020
0.990655
0.844363
0.995569
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2020-01-13, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.9% of ...
true
arxiv:1811.07104
1811.07104
On Hallucinating Context and Background Pixels from a Face Mask using Multi-scale GANs
On Hallucinating Context and Background Pixels from a Face Mask using Multi-scale GANs We propose a multi-scale GAN model to hallucinate realistic context (forehead, hair, neck, clothes) and background pixels automatically from a single input face mask. Instead of swapping a face on to an existing picture, our model d...
https://arxiv.org/abs/1811.07104
null
cs.CV
2020-01-12T00:00:00+00:00
pre2021
2020-01-12
2,020
0.990672
0.844389
0.995573
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2020-01-12, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.9% of ...
true
arxiv:1811.08111
1811.08111
Improving Sequence-to-Sequence Acoustic Modeling by Adding Text-Supervision
Improving Sequence-to-Sequence Acoustic Modeling by Adding Text-Supervision This paper presents methods of making using of text supervision to improve the performance of sequence-to-sequence (seq2seq) voice conversion. Compared with conventional frame-to-frame voice conversion approaches, the seq2seq acoustic modeling...
https://arxiv.org/abs/1811.08111
10.1109/ICASSP.2019.8682380
cs.SD
2018-11-20T00:00:00+00:00
pre2021
2018-11-20
2,018
0.99433
0.850145
0.996348
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2018-11-20, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.5% of ...
true
arxiv:1811.12127
1811.12127
Scaling up Probabilistic Inference in Linear and Non-Linear Hybrid Domains by Leveraging Knowledge Compilation
Scaling up Probabilistic Inference in Linear and Non-Linear Hybrid Domains by Leveraging Knowledge Compilation Weighted model integration (WMI) extends weighted model counting (WMC) in providing a computational abstraction for probabilistic inference in mixed discrete-continuous domains. WMC has emerged as an assembly...
https://arxiv.org/abs/1811.12127
null
cs.AI
2020-01-13T00:00:00+00:00
pre2021
2020-01-13
2,020
0.990655
0.844363
0.995569
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2020-01-13, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.9% of ...
true
arxiv:1902.03511
1902.03511
Nonparametric Density Estimation & Convergence Rates for GANs under Besov IPM Losses
Nonparametric Density Estimation & Convergence Rates for GANs under Besov IPM Losses We study the problem of estimating a nonparametric probability density under a large family of losses called Besov IPMs, which include, for example, $\mathcal{L}^p$ distances, total variation distance, and generalizations of both Wass...
https://arxiv.org/abs/1902.03511
null
math.ST
2020-01-13T00:00:00+00:00
pre2021
2020-01-13
2,020
0.990655
0.844363
0.995569
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2020-01-13, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.9% of ...
true
arxiv:1902.03912
1902.03912
Energy-recycling Blockchain with Proof-of-Deep-Learning
Energy-recycling Blockchain with Proof-of-Deep-Learning An enormous amount of energy is wasted in Proofof-Work (PoW) mechanisms adopted by popular blockchain applications (e.g., PoW-based cryptocurrencies), because miners must conduct a large amount of computation. Owing to this, one serious rising concern is that the...
https://arxiv.org/abs/1902.03912
10.1109/BLOC.2019.8751419
cs.CR
2019-02-11T00:00:00+00:00
pre2021
2019-02-11
2,019
0.993971
0.849576
0.996275
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2019-02-11, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.5% of ...
true
arxiv:1902.05213
1902.05213
Non-Asymptotic Analysis of Monte Carlo Tree Search
Non-Asymptotic Analysis of Monte Carlo Tree Search In this work, we consider the popular tree-based search strategy within the framework of reinforcement learning, the Monte Carlo Tree Search (MCTS), in the context of infinite-horizon discounted cost Markov Decision Process (MDP). While MCTS is believed to provide an ...
https://arxiv.org/abs/1902.05213
null
stat.ML
2020-01-13T00:00:00+00:00
pre2021
2020-01-13
2,020
0.990655
0.844363
0.995569
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2020-01-13, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.9% of ...
true
arxiv:1903.00938
1903.00938
Optimal quadratic element on rectangular grids for $H^1$ problems
Optimal quadratic element on rectangular grids for $H^1$ problems In this paper, a piecewise quadratic finite element method on rectangular grids for the $H^1$ problems is presented. The proposed method can be viewed as a reduced rectangular Morley element. For the source problem, the convergence rate of this scheme i...
https://arxiv.org/abs/1903.00938
null
math.NA
2020-01-13T00:00:00+00:00
pre2021
2020-01-13
2,020
0.990655
0.844363
0.995569
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2020-01-13, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.9% of ...
true
arxiv:1903.03820
1903.03820
Hybrid Transceiver Optimization for Multi-Hop Communications
Hybrid Transceiver Optimization for Multi-Hop Communications Multi-hop communication with the aid of large-scale antenna arrays will play a vital role in future emergence communication systems. In this paper, we investigate amplify-and-forward based and multiple-input multiple-output assisted multi-hop communication, ...
https://arxiv.org/abs/1903.03820
null
cs.IT
2020-01-13T00:00:00+00:00
pre2021
2020-01-13
2,020
0.990655
0.844363
0.995569
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2020-01-13, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.9% of ...
true
arxiv:1903.03989
1903.03989
Uncertainty Propagation in Deep Neural Network Using Active Subspace
Uncertainty Propagation in Deep Neural Network Using Active Subspace The inputs of deep neural network (DNN) from real-world data usually come with uncertainties. Yet, it is challenging to propagate the uncertainty in the input features to the DNN predictions at a low computational cost. This work employs a gradient-b...
https://arxiv.org/abs/1903.03989
null
stat.ML
2020-01-11T00:00:00+00:00
pre2021
2020-01-11
2,020
0.990689
0.844416
0.995576
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2020-01-11, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.9% of ...
true
arxiv:1903.06822
1903.06822
Fundamentals of Power Allocation Strategies for Downlink Multi-user NOMA with Target Rates
Fundamentals of Power Allocation Strategies for Downlink Multi-user NOMA with Target Rates For downlink multi-user non-orthogonal multiple access (NOMA) systems with successive interference cancellation (SIC) receivers, and a base-station not possessing the instantaneous channel gains, the fundamental relationship bet...
https://arxiv.org/abs/1903.06822
10.1109/TWC.2019.2959763
cs.IT
2020-01-06T00:00:00+00:00
pre2021
2020-01-06
2,020
0.990773
0.844547
0.995595
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2020-01-06, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.9% of ...
true
arxiv:1903.07520
1903.07520
EV-IMO: Motion Segmentation Dataset and Learning Pipeline for Event Cameras
EV-IMO: Motion Segmentation Dataset and Learning Pipeline for Event Cameras We present the first event-based learning approach for motion segmentation in indoor scenes and the first event-based dataset - EV-IMO - which includes accurate pixel-wise motion masks, egomotion and ground truth depth. Our approach is based o...
https://arxiv.org/abs/1903.07520
null
cs.CV
2020-01-12T00:00:00+00:00
pre2021
2020-01-12
2,020
0.990672
0.844389
0.995573
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2020-01-12, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.9% of ...
true
arxiv:1904.03865
1904.03865
Implicit-Explicit multistep methods for hyperbolic systems with multiscale relaxation
Implicit-Explicit multistep methods for hyperbolic systems with multiscale relaxation We consider the development of high order space and time numerical methods based on Implicit-Explicit (IMEX) multistep time integrators for hyperbolic systems with relaxation. More specifically, we consider hyperbolic balance laws in...
https://arxiv.org/abs/1904.03865
null
math.NA
2020-01-11T00:00:00+00:00
pre2021
2020-01-11
2,020
0.990689
0.844416
0.995576
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2020-01-11, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.9% of ...
true
arxiv:1904.04232
1904.04232
A Closer Look at Few-shot Classification
A Closer Look at Few-shot Classification Few-shot classification aims to learn a classifier to recognize unseen classes during training with limited labeled examples. While significant progress has been made, the growing complexity of network designs, meta-learning algorithms, and differences in implementation details...
https://arxiv.org/abs/1904.04232
null
cs.CV
2020-01-12T00:00:00+00:00
pre2021
2020-01-12
2,020
0.990672
0.844389
0.995573
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2020-01-12, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.9% of ...
true
arxiv:1905.01851
1905.01851
P-ODN: Prototype based Open Deep Network for Open Set Recognition
P-ODN: Prototype based Open Deep Network for Open Set Recognition Most of the existing recognition algorithms are proposed for closed set scenarios, where all categories are known beforehand. However, in practice, recognition is essentially an open set problem. There are categories we know called "knowns", and there a...
https://arxiv.org/abs/1905.01851
null
cs.CV
2020-01-13T00:00:00+00:00
pre2021
2020-01-13
2,020
0.990655
0.844363
0.995569
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2020-01-13, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.9% of ...
true
arxiv:1905.07026
1905.07026
Fairness in Machine Learning with Tractable Models
Fairness in Machine Learning with Tractable Models Machine Learning techniques have become pervasive across a range of different applications, and are now widely used in areas as disparate as recidivism prediction, consumer credit-risk analysis and insurance pricing. The prevalence of machine learning techniques has r...
https://arxiv.org/abs/1905.07026
null
cs.LG
2020-01-13T00:00:00+00:00
pre2021
2020-01-13
2,020
0.990655
0.844363
0.995569
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2020-01-13, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.9% of ...
true
arxiv:1905.08139
1905.08139
Self-Supervised Similarity Learning for Digital Pathology
Self-Supervised Similarity Learning for Digital Pathology Using features extracted from networks pretrained on ImageNet is a common practice in applications of deep learning for digital pathology. However it presents the downside of missing domain specific image information. In digital pathology, supervised training d...
https://arxiv.org/abs/1905.08139
null
cs.CV
2020-01-13T00:00:00+00:00
pre2021
2020-01-13
2,020
0.990655
0.844363
0.995569
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2020-01-13, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.9% of ...
true
arxiv:1905.10090
1905.10090
Deploying AI Frameworks on Secure HPC Systems with Containers
Deploying AI Frameworks on Secure HPC Systems with Containers The increasing interest in the usage of Artificial Intelligence techniques (AI) from the research community and industry to tackle "real world" problems, requires High Performance Computing (HPC) resources to efficiently compute and scale complex algorithms...
https://arxiv.org/abs/1905.10090
10.1109/HPEC.2019.8916576
cs.DC
2019-05-24T00:00:00+00:00
pre2021
2019-05-24
2,019
0.993351
0.848594
0.996147
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2019-05-24, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.6% of ...
true
arxiv:1905.10841
1905.10841
Utilizing Automated Breast Cancer Detection to Identify Spatial Distributions of Tumor Infiltrating Lymphocytes in Invasive Breast Cancer
Utilizing Automated Breast Cancer Detection to Identify Spatial Distributions of Tumor Infiltrating Lymphocytes in Invasive Breast Cancer Quantitative assessment of Tumor-TIL spatial relationships is increasingly important in both basic science and clinical aspects of breast cancer research. We have developed and eval...
https://arxiv.org/abs/1905.10841
null
eess.IV
2020-01-13T00:00:00+00:00
pre2021
2020-01-13
2,020
0.990655
0.844363
0.995569
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2020-01-13, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.9% of ...
true
arxiv:1905.12119
1905.12119
Order reduction methods for solving large-scale differential matrix Riccati equations
Order reduction methods for solving large-scale differential matrix Riccati equations We consider the numerical solution of large-scale symmetric differential matrix Riccati equations. Under certain hypotheses on the data, reduced order methods have recently arisen as a promising class of solution strategies, by formi...
https://arxiv.org/abs/1905.12119
null
math.NA
2020-01-13T00:00:00+00:00
pre2021
2020-01-13
2,020
0.990655
0.844363
0.995569
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2020-01-13, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.9% of ...
true
arxiv:1906.01797
1906.01797
StarNet: Pedestrian Trajectory Prediction using Deep Neural Network in Star Topology
StarNet: Pedestrian Trajectory Prediction using Deep Neural Network in Star Topology Pedestrian trajectory prediction is crucial for many important applications. This problem is a great challenge because of complicated interactions among pedestrians. Previous methods model only the pairwise interactions between pedest...
https://arxiv.org/abs/1906.01797
null
cs.CV
2020-01-13T00:00:00+00:00
pre2021
2020-01-13
2,020
0.990655
0.844363
0.995569
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2020-01-13, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.9% of ...
true
arxiv:1906.04346
1906.04346
Heterogeneous network approach to predict individuals' mental health
Heterogeneous network approach to predict individuals' mental health Depression and anxiety are critical public health issues affecting millions of people around the world. To identify individuals who are vulnerable to depression and anxiety, predictive models have been built that typically utilize data from one sourc...
https://arxiv.org/abs/1906.04346
null
cs.SI
2020-01-13T00:00:00+00:00
pre2021
2020-01-13
2,020
0.990655
0.844363
0.995569
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2020-01-13, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.9% of ...
true
arxiv:1906.04863
1906.04863
Statistical guarantees for local graph clustering
Statistical guarantees for local graph clustering Local graph clustering methods aim to find small clusters in very large graphs. These methods take as input a graph and a seed node, and they return as output a good cluster in a running time that depends on the size of the output cluster but that is independent of the...
https://arxiv.org/abs/1906.04863
null
cs.LG
2020-01-11T00:00:00+00:00
pre2021
2020-01-11
2,020
0.990689
0.844416
0.995576
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2020-01-11, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.9% of ...
true
arxiv:1906.05963
1906.05963
Image Captioning: Transforming Objects into Words
Image Captioning: Transforming Objects into Words Image captioning models typically follow an encoder-decoder architecture which uses abstract image feature vectors as input to the encoder. One of the most successful algorithms uses feature vectors extracted from the region proposals obtained from an object detector. ...
https://arxiv.org/abs/1906.05963
null
cs.CV
2020-01-11T00:00:00+00:00
pre2021
2020-01-11
2,020
0.990689
0.844416
0.995576
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2020-01-11, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.9% of ...
true
arxiv:1906.06558
1906.06558
Mask Based Unsupervised Content Transfer
Mask Based Unsupervised Content Transfer We consider the problem of translating, in an unsupervised manner, between two domains where one contains some additional information compared to the other. The proposed method disentangles the common and separate parts of these domains and, through the generation of a mask, fo...
https://arxiv.org/abs/1906.06558
null
cs.CV
2020-01-13T00:00:00+00:00
pre2021
2020-01-13
2,020
0.990655
0.844363
0.995569
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2020-01-13, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.9% of ...
true
arxiv:1906.06725
1906.06725
Persuasion for Good: Towards a Personalized Persuasive Dialogue System for Social Good
Persuasion for Good: Towards a Personalized Persuasive Dialogue System for Social Good Developing intelligent persuasive conversational agents to change people's opinions and actions for social good is the frontier in advancing the ethical development of automated dialogue systems. To do so, the first step is to under...
https://arxiv.org/abs/1906.06725
null
cs.CL
2020-01-13T00:00:00+00:00
pre2021
2020-01-13
2,020
0.990655
0.844363
0.995569
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2020-01-13, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.9% of ...
true
arxiv:1906.06907
1906.06907
Optimal Combination of Frequency Control and Peak Shaving with Battery Storage Systems
Optimal Combination of Frequency Control and Peak Shaving with Battery Storage Systems Combining revenue streams by providing multiple services with battery storage systems increases profitability and enhances the investment case. In this work, we present a novel optimisation and control framework that enables a stora...
https://arxiv.org/abs/1906.06907
10.1109/TSG.2019.2963098
math.OC
2020-01-13T00:00:00+00:00
pre2021
2020-01-13
2,020
0.990655
0.844363
0.995569
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2020-01-13, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.9% of ...
true
arxiv:1906.10508
1906.10508
Non-Parallel Sequence-to-Sequence Voice Conversion with Disentangled Linguistic and Speaker Representations
Non-Parallel Sequence-to-Sequence Voice Conversion with Disentangled Linguistic and Speaker Representations This paper presents a method of sequence-to-sequence (seq2seq) voice conversion using non-parallel training data. In this method, disentangled linguistic and speaker representations are extracted from acoustic f...
https://arxiv.org/abs/1906.10508
10.1109/TASLP.2019.2960721
eess.AS
2019-12-13T00:00:00+00:00
pre2021
2019-12-13
2,019
0.991156
0.845145
0.995679
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2019-12-13, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.8% of ...
true
arxiv:1906.11695
1906.11695
Demonstration-Guided Deep Reinforcement Learning of Control Policies for Dexterous Human-Robot Interaction
Demonstration-Guided Deep Reinforcement Learning of Control Policies for Dexterous Human-Robot Interaction In this paper, we propose a method for training control policies for human-robot interactions such as handshakes or hand claps via Deep Reinforcement Learning. The policy controls a humanoid Shadow Dexterous Hand...
https://arxiv.org/abs/1906.11695
10.1109/ICRA.2019.8794065
cs.RO
2020-01-13T00:00:00+00:00
pre2021
2020-01-13
2,020
0.990655
0.844363
0.995569
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2020-01-13, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.9% of ...
true
arxiv:1907.01815
1907.01815
Circular Pattern Matching with $k$ Mismatches
Circular Pattern Matching with $k$ Mismatches The $k$-mismatch problem consists in computing the Hamming distance between a pattern $P$ of length $m$ and every length-$m$ substring of a text $T$ of length $n$, if this distance is no more than $k$. In many real-world applications, any cyclic rotation of $P$ is a releva...
https://arxiv.org/abs/1907.01815
null
cs.DS
2020-01-13T00:00:00+00:00
pre2021
2020-01-13
2,020
0.990655
0.844363
0.995569
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2020-01-13, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.9% of ...
true
arxiv:1907.04650
1907.04650
Hardware/Software Co-Exploration of Neural Architectures
Hardware/Software Co-Exploration of Neural Architectures We propose a novel hardware and software co-exploration framework for efficient neural architecture search (NAS). Different from existing hardware-aware NAS which assumes a fixed hardware design and explores the neural architecture search space only, our framewo...
https://arxiv.org/abs/1907.04650
null
cs.LG
2020-01-11T00:00:00+00:00
pre2021
2020-01-11
2,020
0.990689
0.844416
0.995576
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2020-01-11, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.9% of ...
true
arxiv:1907.07565
1907.07565
Optimal Energy Allocation and Task Offloading Policy for Wireless Powered Mobile Edge Computing Systems
Optimal Energy Allocation and Task Offloading Policy for Wireless Powered Mobile Edge Computing Systems This paper studies a wireless powered mobile edge computing (MEC) system with fluctuating channels and dynamic task arrivals over time. We jointly optimize the transmission energy allocation at the energy transmitte...
https://arxiv.org/abs/1907.07565
10.1109/TWC.2020.2964765
cs.IT
2020-01-13T00:00:00+00:00
pre2021
2020-01-13
2,020
0.990655
0.844363
0.995569
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2020-01-13, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.9% of ...
true
arxiv:1908.02444
1908.02444
A Verified Architecture for Proofs of Execution on Remote Devices under Full Software Compromise
A Verified Architecture for Proofs of Execution on Remote Devices under Full Software Compromise Modern society is increasingly surrounded by, and accustomed to, a wide range of Cyber-Physical Systems (CPS), Internet-of-Things (IoT), and smart devices. They often perform safety-critical functions, e.g., personal medic...
https://arxiv.org/abs/1908.02444
null
cs.CR
2020-01-10T00:00:00+00:00
pre2021
2020-01-10
2,020
0.990706
0.844442
0.99558
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2020-01-10, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.9% of ...
true
arxiv:1908.02726
1908.02726
Cascaded Revision Network for Novel Object Captioning
Cascaded Revision Network for Novel Object Captioning Image captioning, a challenging task where the machine automatically describes an image by sentences, has drawn significant attention in recent years. Despite the remarkable improvements of recent approaches, however, these methods are built upon a large set of tra...
https://arxiv.org/abs/1908.02726
10.1109/TCSVT.2020.2965966
cs.MM
2019-08-06T00:00:00+00:00
pre2021
2019-08-06
2,019
0.992731
0.847616
0.996018
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2019-08-06, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.7% of ...
true
arxiv:1908.03118
1908.03118
Efficient 3D Reconstruction and Streaming for Group-Scale Multi-Client Live Telepresence
Efficient 3D Reconstruction and Streaming for Group-Scale Multi-Client Live Telepresence Sharing live telepresence experiences for teleconferencing or remote collaboration receives increasing interest with the recent progress in capturing and AR/VR technology. Whereas impressive telepresence systems have been proposed...
https://arxiv.org/abs/1908.03118
10.1109/ISMAR.2019.00018
cs.HC
2020-01-13T00:00:00+00:00
pre2021
2020-01-13
2,020
0.990655
0.844363
0.995569
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2020-01-13, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.9% of ...
true
arxiv:1908.04466
1908.04466
Few Labeled Atlases are Necessary for Deep-Learning-Based Segmentation
Few Labeled Atlases are Necessary for Deep-Learning-Based Segmentation We tackle biomedical image segmentation in the scenario of only a few labeled brain MR images. This is an important and challenging task in medical applications, where manual annotations are time-consuming. Current multi-atlas based segmentation me...
https://arxiv.org/abs/1908.04466
null
cs.CV
2020-01-13T00:00:00+00:00
pre2021
2020-01-13
2,020
0.990655
0.844363
0.995569
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2020-01-13, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.9% of ...
true
arxiv:1908.05434
1908.05434
Sex Trafficking Detection with Ordinal Regression Neural Networks
Sex Trafficking Detection with Ordinal Regression Neural Networks Sex trafficking is a global epidemic. Escort websites are a primary vehicle for selling the services of such trafficking victims and thus a major driver of trafficker revenue. Many law enforcement agencies do not have the resources to manually identify ...
https://arxiv.org/abs/1908.05434
null
cs.LG
2020-01-12T00:00:00+00:00
pre2021
2020-01-12
2,020
0.990672
0.844389
0.995573
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2020-01-12, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.9% of ...
true
arxiv:1908.08280
1908.08280
RadChat: Spectrum Sharing for Automotive Radar Interference Mitigation
RadChat: Spectrum Sharing for Automotive Radar Interference Mitigation In the automotive sector, both radars and wireless communication are susceptible to interference. However, combining the radar and communication systems, i.e., radio frequency (RF) communications and sensing convergence, has the potential to mitiga...
https://arxiv.org/abs/1908.08280
10.1109/TITS.2019.2959881
cs.IT
2020-01-13T00:00:00+00:00
pre2021
2020-01-13
2,020
0.990655
0.844363
0.995569
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2020-01-13, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.9% of ...
true
arxiv:1908.10768
1908.10768
Convolutional Recurrent Neural Network Based Progressive Learning for Monaural Speech Enhancement
Convolutional Recurrent Neural Network Based Progressive Learning for Monaural Speech Enhancement Recently, progressive learning has shown its capacity to improve speech quality and speech intelligibility when it is combined with deep neural network (DNN) and long short-term memory (LSTM) based monaural speech enhance...
https://arxiv.org/abs/1908.10768
null
cs.SD
2020-01-11T00:00:00+00:00
pre2021
2020-01-11
2,020
0.990689
0.844416
0.995576
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2020-01-11, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.9% of ...
true
arxiv:1909.01182
1909.01182
Combining Multi-Sequence and Synthetic Images for Improved Segmentation of Late Gadolinium Enhancement Cardiac MRI
Combining Multi-Sequence and Synthetic Images for Improved Segmentation of Late Gadolinium Enhancement Cardiac MRI Accurate segmentation of the cardiac boundaries in late gadolinium enhancement magnetic resonance images (LGE-MRI) is a fundamental step for accurate quantification of scar tissue. However, while there ar...
https://arxiv.org/abs/1909.01182
null
eess.IV
2020-01-13T00:00:00+00:00
pre2021
2020-01-13
2,020
0.990655
0.844363
0.995569
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2020-01-13, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.9% of ...
true
arxiv:1909.01513
1909.01513
Propagate and Pair: A Single-Pass Approach to Critical Point Pairing in Reeb Graphs
Propagate and Pair: A Single-Pass Approach to Critical Point Pairing in Reeb Graphs With the popularization of Topological Data Analysis, the Reeb graph has found new applications as a summarization technique in the analysis and visualization of large and complex data, whose usefulness extends beyond just the graph it...
https://arxiv.org/abs/1909.01513
10.1007/978-3-030-33720-9_8
cs.CG
2019-09-06T00:00:00+00:00
pre2021
2019-09-06
2,019
0.992417
0.847122
0.995951
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2019-09-06, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.7% of ...
true
arxiv:1909.04491
1909.04491
Graph-based data clustering via multiscale community detection
Graph-based data clustering via multiscale community detection We present a graph-theoretical approach to data clustering, which combines the creation of a graph from the data with Markov Stability, a multiscale community detection framework. We show how the multiscale capabilities of the method allow the estimation o...
https://arxiv.org/abs/1909.04491
10.1007/s41109-019-0248-7
cs.IR
2020-01-13T00:00:00+00:00
pre2021
2020-01-13
2,020
0.990655
0.844363
0.995569
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2020-01-13, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.9% of ...
true
arxiv:1909.04723
1909.04723
Neural Networks for Relational Data
Neural Networks for Relational Data While deep networks have been enormously successful over the last decade, they rely on flat-feature vector representations, which makes them unsuitable for richly structured domains such as those arising in applications like social network analysis. Such domains rely on relational r...
https://arxiv.org/abs/1909.04723
null
cs.LG
2020-01-13T00:00:00+00:00
pre2021
2020-01-13
2,020
0.990655
0.844363
0.995569
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2020-01-13, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.9% of ...
true
arxiv:1909.07038
1909.07038
Boosting Real-Time Driving Scene Parsing with Shared Semantics
Boosting Real-Time Driving Scene Parsing with Shared Semantics Real-time scene parsing is a fundamental feature for autonomous driving vehicles with multiple cameras. In this letter we demonstrate that sharing semantics between cameras with different perspectives and overlapped views can boost the parsing performance ...
https://arxiv.org/abs/1909.07038
10.1109/LRA.2020.2965075
cs.CV
2019-11-28T00:00:00+00:00
pre2021
2019-11-28
2,019
0.99138
0.845494
0.995728
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2019-11-28, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.8% of ...
true
arxiv:1909.09398
1909.09398
Clock Error Analysis of Common Time of Flight based Positioning Methods
Clock Error Analysis of Common Time of Flight based Positioning Methods Today, many applications such as production or rescue settings rely on highly accurate entity positioning. Advanced Time of Flight (ToF) based positioning methods provide highaccuracy localization of entities. A key challenge for ToF based positio...
https://arxiv.org/abs/1909.09398
10.1109/IPIN.2019.8911772
cs.NI
2020-01-12T00:00:00+00:00
pre2021
2020-01-12
2,020
0.990672
0.844389
0.995573
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2020-01-12, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.9% of ...
true
arxiv:1909.09405
1909.09405
A Generalized TDoA/ToA Model for ToF Positioning
A Generalized TDoA/ToA Model for ToF Positioning Many applications require positioning. Time of Flight (ToF) methods calculate distances by measuring the propagation time of signals. We present a novel ToF localization method. Our new approach works infrastructure-less, without pre-defined roles like Anchors or Tags. ...
https://arxiv.org/abs/1909.09405
10.1109/IPIN.2019.8911742
cs.NI
2020-01-12T00:00:00+00:00
pre2021
2020-01-12
2,020
0.990672
0.844389
0.995573
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2020-01-12, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.9% of ...
true
arxiv:1909.10766
1909.10766
The space complexity of inner product filters
The space complexity of inner product filters Motivated by the problem of filtering candidate pairs in inner product similarity joins we study the following inner product estimation problem: Given parameters $d\in {\bf N}$, $α>β\geq 0$ and unit vectors $x,y\in {\bf R}^{d}$ consider the task of distinguishing between...
https://arxiv.org/abs/1909.10766
null
cs.DS
2020-01-12T00:00:00+00:00
pre2021
2020-01-12
2,020
0.990672
0.844389
0.995573
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2020-01-12, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.9% of ...
true
arxiv:1909.12226
1909.12226
A Heuristic for Efficient Reduction in Hidden Layer Combinations For Feedforward Neural Networks
A Heuristic for Efficient Reduction in Hidden Layer Combinations For Feedforward Neural Networks In this paper, we describe the hyper-parameter search problem in the field of machine learning and present a heuristic approach in an attempt to tackle it. In most learning algorithms, a set of hyper-parameters must be det...
https://arxiv.org/abs/1909.12226
null
cs.LG
2020-01-11T00:00:00+00:00
pre2021
2020-01-11
2,020
0.990689
0.844416
0.995576
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2020-01-11, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.9% of ...
true
arxiv:1910.01170
1910.01170
The tension between openness and prudence in AI research
The tension between openness and prudence in AI research This paper explores the tension between openness and prudence in AI research, evident in two core principles of the Montréal Declaration for Responsible AI. While the AI community has strong norms around open sharing of research, concerns about the potential ha...
https://arxiv.org/abs/1910.01170
null
cs.CY
2020-01-13T00:00:00+00:00
pre2021
2020-01-13
2,020
0.990655
0.844363
0.995569
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2020-01-13, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.9% of ...
true
arxiv:1910.04600
1910.04600
Succinct Population Protocols for Presburger Arithmetic
Succinct Population Protocols for Presburger Arithmetic Angluin et al. proved that population protocols compute exactly the predicates definable in Presburger arithmetic (PA), the first-order theory of addition. As part of this result, they presented a procedure that translates any formula $φ$ of quantifier-free PA w...
https://arxiv.org/abs/1910.04600
null
cs.DC
2020-01-13T00:00:00+00:00
pre2021
2020-01-13
2,020
0.990655
0.844363
0.995569
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2020-01-13, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.9% of ...
true
arxiv:1910.05475
1910.05475
Saliency Guided Self-attention Network for Weakly and Semi-supervised Semantic Segmentation
Saliency Guided Self-attention Network for Weakly and Semi-supervised Semantic Segmentation Weakly supervised semantic segmentation (WSSS) using only image-level labels can greatly reduce the annotation cost and therefore has attracted considerable research interest. However, its performance is still inferior to the f...
https://arxiv.org/abs/1910.05475
null
cs.CV
2020-01-12T00:00:00+00:00
pre2021
2020-01-12
2,020
0.990672
0.844389
0.995573
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2020-01-12, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.9% of ...
true
arxiv:1910.05564
1910.05564
What's My Process Model Composed of? A Systematic Literature Review of Meta-Models in BPM
What's My Process Model Composed of? A Systematic Literature Review of Meta-Models in BPM Business process modelling languages typically enable the representation of business process models by employing (graphical) symbols. These symbols can vary depending upon the verbosity of the language, the modeling paradigm, the...
https://arxiv.org/abs/1910.05564
null
cs.OH
2020-01-13T00:00:00+00:00
pre2021
2020-01-13
2,020
0.990655
0.844363
0.995569
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2020-01-13, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.9% of ...
true
arxiv:1910.07144
1910.07144
Similarity Driven Approximation for Text Analytics
Similarity Driven Approximation for Text Analytics Text analytics has become an important part of business intelligence as enterprises increasingly seek to extract insights for decision making from text data sets. Processing large text data sets can be computationally expensive, however, especially if it involves soph...
https://arxiv.org/abs/1910.07144
null
cs.DB
2020-01-12T00:00:00+00:00
pre2021
2020-01-12
2,020
0.990672
0.844389
0.995573
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2020-01-12, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.9% of ...
true
arxiv:1910.09600
1910.09600
Is graph-based feature selection of genes better than random?
Is graph-based feature selection of genes better than random? Gene interaction graphs aim to capture various relationships between genes and represent decades of biology research. When trying to make predictions from genomic data, those graphs could be used to overcome the curse of dimensionality by making machine lea...
https://arxiv.org/abs/1910.09600
null
q-bio.GN
2019-12-27T00:00:00+00:00
pre2021
2019-12-27
2,019
0.990936
0.844802
0.995631
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2019-12-27, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.8% of ...
true
arxiv:1910.10393
1910.10393
RTOP: A Conceptual and Computational Framework for General Intelligence
RTOP: A Conceptual and Computational Framework for General Intelligence A novel general intelligence model is proposed with three types of learning. A unified sequence of the foreground percept trace and the command trace translates into direct and time-hop observation paths to form the basis of Raw learning. Raw lear...
https://arxiv.org/abs/1910.10393
null
cs.AI
2020-01-11T00:00:00+00:00
pre2021
2020-01-11
2,020
0.990689
0.844416
0.995576
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2020-01-11, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.9% of ...
true
arxiv:1910.12527
1910.12527
RPM-Oriented Query Rewriting Framework for E-commerce Keyword-Based Sponsored Search
RPM-Oriented Query Rewriting Framework for E-commerce Keyword-Based Sponsored Search Sponsored search optimizes revenue and relevance, which is estimated by Revenue Per Mille (RPM). Existing sponsored search models are all based on traditional statistical models, which have poor RPM performance when queries follow a h...
https://arxiv.org/abs/1910.12527
null
cs.CL
2020-01-11T00:00:00+00:00
pre2021
2020-01-11
2,020
0.990689
0.844416
0.995576
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2020-01-11, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.9% of ...
true
arxiv:1910.13297
1910.13297
Flexible Graph Connectivity: Approximating Network Design Problems Between 1- and 2-connectivity
Flexible Graph Connectivity: Approximating Network Design Problems Between 1- and 2-connectivity Graph connectivity and network design problems are among the most fundamental problems in combinatorial optimization. The minimum spanning tree problem, the two edge-connected spanning subgraph problem (2-ECSS) and the tre...
https://arxiv.org/abs/1910.13297
null
cs.DS
2020-01-13T00:00:00+00:00
pre2021
2020-01-13
2,020
0.990655
0.844363
0.995569
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2020-01-13, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.9% of ...
true
arxiv:1910.14488
1910.14488
NAT: Neural Architecture Transformer for Accurate and Compact Architectures
NAT: Neural Architecture Transformer for Accurate and Compact Architectures Designing effective architectures is one of the key factors behind the success of deep neural networks. Existing deep architectures are either manually designed or automatically searched by some Neural Architecture Search (NAS) methods. Howeve...
https://arxiv.org/abs/1910.14488
null
cs.LG
2020-01-13T00:00:00+00:00
pre2021
2020-01-13
2,020
0.990655
0.844363
0.995569
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2020-01-13, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.9% of ...
true
arxiv:1911.00208
1911.00208
LFZip: Lossy compression of multivariate floating-point time series data via improved prediction
LFZip: Lossy compression of multivariate floating-point time series data via improved prediction Time series data compression is emerging as an important problem with the growth in IoT devices and sensors. Due to the presence of noise in these datasets, lossy compression can often provide significant compression gains...
https://arxiv.org/abs/1911.00208
null
eess.SP
2020-01-13T00:00:00+00:00
pre2021
2020-01-13
2,020
0.990655
0.844363
0.995569
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2020-01-13, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.9% of ...
true
arxiv:1911.03630
1911.03630
Action Recognition Using Supervised Spiking Neural Networks
Action Recognition Using Supervised Spiking Neural Networks Biological neurons use spikes to process and learn temporally dynamic inputs in an energy and computationally efficient way. However, applying the state-of-the-art gradient-based supervised algorithms to spiking neural networks (SNN) is a challenge due to the...
https://arxiv.org/abs/1911.03630
null
cs.CV
2020-01-11T00:00:00+00:00
pre2021
2020-01-11
2,020
0.990689
0.844416
0.995576
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2020-01-11, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.9% of ...
true
arxiv:1911.08136
1911.08136
Enhancing the Extraction of Interpretable Information for Ischemic Stroke Imaging from Deep Neural Networks
Enhancing the Extraction of Interpretable Information for Ischemic Stroke Imaging from Deep Neural Networks We implement a visual interpretability method Layer-wise Relevance Propagation (LRP) on top of 3D U-Net trained to perform lesion segmentation on the small dataset of multi-modal images provided by ISLES 2017 co...
https://arxiv.org/abs/1911.08136
null
eess.IV
2020-01-13T00:00:00+00:00
pre2021
2020-01-13
2,020
0.990655
0.844363
0.995569
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2020-01-13, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.9% of ...
true
arxiv:1911.08914
1911.08914
Nonconvex Nonsmooth Low-Rank Minimization for Generalized Image Compressed Sensing via Group Sparse Representation
Nonconvex Nonsmooth Low-Rank Minimization for Generalized Image Compressed Sensing via Group Sparse Representation Group sparse representation (GSR) based method has led to great successes in various image recovery tasks, which can be converted into a low-rank matrix minimization problem. As a widely used surrogate fu...
https://arxiv.org/abs/1911.08914
null
eess.IV
2020-01-13T00:00:00+00:00
pre2021
2020-01-13
2,020
0.990655
0.844363
0.995569
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2020-01-13, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.9% of ...
true
arxiv:1911.09276
1911.09276
Doubling the near-infrared photocurrent in a solar cell via omni-resonant coherent perfect absorption
Doubling the near-infrared photocurrent in a solar cell via omni-resonant coherent perfect absorption Minimizing the material usage in thin-film solar cells can reduce manufacturing costs and enable mechanically flexible implementations, but concomitantly diminishes optical absorption. Coherent optical effects can hel...
https://arxiv.org/abs/1911.09276
null
physics.optics
2020-01-13T00:00:00+00:00
pre2021
2020-01-13
2,020
0.990655
0.844363
0.995569
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2020-01-13, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.9% of ...
true
arxiv:1911.11088
1911.11088
First Year Computer Science Projects at Coventry University: Activity-led integrative team projects with continuous assessment
First Year Computer Science Projects at Coventry University: Activity-led integrative team projects with continuous assessment We describe the group projects undertaken by first year undergraduate Computer Science students at Coventry University. These are integrative course projects: designed to bring together the to...
https://arxiv.org/abs/1911.11088
10.1145/3372356.3372358
cs.CY
2019-11-25T00:00:00+00:00
pre2021
2019-11-25
2,019
0.991423
0.845562
0.995737
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2019-11-25, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.8% of ...
true