text stringlengths 8 3.91k | label int64 0 10 |
|---|---|
abstract
the study of combinatorial optimization problems with a submodular objective has attracted
much attention in recent years. such problems are important in both theory and practice because
their objective functions are very general. obtaining further improvements for many submodular
maximization problems boils d... | 8 |
abstract
numerous variants of self-organizing maps (soms) have been proposed in the literature, including
those which also possess an underlying structure, and in some cases, this structure itself can be defined
by the user although the concepts of growing the som and updating it have been studied, the whole
issue of u... | 9 |
abstract— we consider the problem of steering a system with
unknown, stochastic dynamics to satisfy a rich, temporallylayered task given as a signal temporal logic formula. we
represent the system as a markov decision process in which
the states are built from a partition of the statespace and
the transition probabilit... | 3 |
abstract. we present high performance implementations of the qr and the singular value decomposition of a batch of small matrices hosted on the gpu with applications in the compression
of hierarchical matrices. the one-sided jacobi algorithm is used for its simplicity and inherent
parallelism as a building block for th... | 8 |
abstract
skew bridges are common in highways and railway lines when non perpendicular crossings are encountered. the structural effect of skewness is an additional
torsion on the bridge deck which may have a considerable effect, making its
analysis and design more complex. in this paper, an analytical model following
3... | 5 |
abstract
in recent years crowdsourcing has become the method of choice for gathering labeled training data
for learning algorithms. standard approaches to crowdsourcing view the process of acquiring labeled
data separately from the process of learning a classifier from the gathered data. this can give rise to
computati... | 8 |
abstract
a novel method to identify trampoline skills using a single video camera is proposed herein. conventional computer vision techniques are used for identification, estimation, and tracking of the gymnast’s body
in a video recording of the routine. for each frame, an open source convolutional neural network is us... | 1 |
abstract machines involved:
the net m of df a’s ms , ma , . . . with state set q = { q, . . . } (states are drawn as circular nodes); the pilot df a p with m-state set r = { i0 , i1 , . . . } (states are drawn as
rectangular nodes); and the dp da a to be next defined. as said, the dp da stores in
the stack the series o... | 6 |
abstract. we present an i/o-efficient algorithm for computing similarity joins based on locality-sensitive hashing (lsh). in contrast to
the filtering methods commonly suggested our method has provable subquadratic dependency on the data size. further, in contrast to straightforward implementations of known lsh-based a... | 8 |
abstract. let a be a commutative ring, and let a be a weakly proregular
ideal in a. (if a is noetherian then any ideal in it is weakly proregular.)
suppose m is a compact generator of the category of cohomologically a-torsion
complexes. we prove that the derived double centralizer of m is isomorphic
to the a-adic compl... | 0 |
abstract
though traditional algorithms could be embedded
into neural architectures with the proposed principle of (xiao, 2017), the variables that only occur
in the condition of branch could not be updated
as a special case. to tackle this issue, we multiply
the conditioned branches with dirac symbol (i.e.
1x>0 ), then... | 9 |
abstract
adams’ extension of parsing expression grammars enables specifying indentation sensitivity using
two non-standard grammar constructs — indentation by a binary relation and alignment. this
paper proposes a step-by-step transformation of well-formed adams’ grammars for elimination
of the alignment construct from... | 6 |
abstraction. | 6 |
abstract
the coalitional manipulation problem has been studied extensively in the literature for many
voting rules. however, most studies have focused on the complete information setting, wherein
the manipulators know the votes of the non-manipulators. while this assumption is reasonable for purposes of showing intract... | 8 |
abstract
we propose a simple approach which, given
distributed computing resources, can nearly
achieve the accuracy of k-nn prediction, while
matching (or improving) the faster prediction
time of 1-nn. the approach consists of aggregating denoised 1-nn predictors over a small
number of distributed subsamples. we show,
... | 10 |
abstract. we consider graded artinian complete intersection algebras a =
c[x0 , . . . , xm ]/i with i generated by homogeneous forms of degree d ≥ 2. we
show that the general multiplication by a linear form µl : ad−1 → ad is
injective. we prove that the weak lefschetz property for holds for any c.i.
algebra a as above ... | 0 |
abstract
recurrent neural networks (rnns), particularly long
short-term memory (lstm), have gained much attention in
automatic speech recognition (asr). although some successful stories have been reported, training rnns remains
highly challenging, especially with limited training data. recent research found that a well... | 9 |
abstract— this paper considers the problem of implementing
a previously proposed distributed direct coupling quantum
observer for a closed linear quantum system. by modifying the
form of the previously proposed observer, the paper proposes
a possible experimental implementation of the observer plant
system using a non-... | 3 |
abstract. using valuation rings and valued fields as examples, we
discuss in which ways the notions of “topological ifs attractor” and
“fractal space” can be generalized to cover more general settings. | 0 |
abstract
we consider the problem of reconstructing an unknown bounded function u defined on a domain x ⊂
rd from noiseless or noisy samples of u at n points (xi )i=1,...,n . we measure the reconstruction error in a
norm l2 (x, dρ) for some given probability measure dρ. given a linear space vm with dim(vm ) = m ≤ n,
we ... | 10 |
abstract
in this paper, we explore different ways to extend a recurrent neural network
(rnn) to a deep rnn. we start by arguing that the concept of depth in an rnn
is not as clear as it is in feedforward neural networks. by carefully analyzing
and understanding the architecture of an rnn, however, we find three points ... | 9 |
abstract—today’s hpc applications are producing extremely large amounts of data, such that data storage and
analysis are becoming more challenging for scientific research.
in this work, we design a new error-controlled lossy compression algorithm for large-scale scientific data. our key
contribution is significantly im... | 7 |
abstract
in this paper we consider the problem of detecting a change in the parameters of an autoregressive process, where the moments of the innovation process
do not necessarily exist. an empirical likelihood ratio test for the existence
of a change point is proposed and its asymptotic properties are studied. in
cont... | 10 |
abstract | 6 |
abstract
pandemic influenza has the epidemic potential to kill millions of people. while various preventive measures exist (i.a., vaccination and school
closures), deciding on strategies that lead to their most effective and efficient use, remains challenging. to this end, individual-based epidemiological models are es... | 2 |
abstract
this paper deals with feature selection procedures for spatial point processes intensity estimation. we consider regularized versions of estimating
equations based on campbell theorem derived from two classical functions:
poisson likelihood and logistic regression likelihood. we provide general conditions on t... | 10 |
abstract—wireless networked control systems (wncs) are
composed of spatially distributed sensors, actuators, and controllers communicating through wireless networks instead of
conventional point-to-point wired connections. due to their main
benefits in the reduction of deployment and maintenance costs,
large flexibilit... | 3 |
abstract. in this article, the projectivity of a finitely generated
flat module of a commutative ring is studied through its exterior
powers and invariant factors. consequently, the related results of
endo, vasconcelos, wiegand, cox-rush and puninski-rothmaler
on the projectivity of f.g. flat modules are generalized. | 0 |
abstract | 2 |
abstract—this paper studies optimal tracking performance
issues for multi-input-multi-output linear time-invariant systems
under networked control with limited bandwidth and additive
colored white gaussian noise channel. the tracking performance
is measured by control input energy and the energy of the error
signal bet... | 3 |
abstract
a group of order pn (p prime) has an indecomposable polynomial
invariant of degree at least pn−1 if and only if the group has a cyclic
subgroup of index at most p or it is isomorphic to the elementary
abelian group of order 8 or the heisenberg group of order 27.
keywords: polynomial invariants, degree bounds, ... | 4 |
abstract. secret sharing is a cryptographic discipline in which the goal is
to distribute information about a secret over a set of participants in such a
way that only specific authorized combinations of participants together can
reconstruct the secret. thus, secret sharing schemes are systems of variables
in which it ... | 7 |
abstract
permutation polynomials over finite fields are an interesting subject due to their important
applications in the areas of mathematics and engineering. in this paper we investigate the trinomial
f (x) = x(p−1)q+1 + xpq − xq+(p−1) over the finite field fq2 , where p is an odd prime and q =
pk with k being a posi... | 7 |
abstracts/definitions) to improve the answering ability of a
model. marino et al. (2017) explicitly incorporate knowledge graphs into an image classification
model. xu et al. (2016) created a recall mechanism into a standard lstm cell that retrieves pieces
of external knowledge encoded by a single representation for a ... | 2 |
abstraction: at the highest level, the software architecture models the
m. bujorianu and m. fisher (eds.):
workshop on formal methods for aerospace (fma)
eptcs 20, 2010, pp. 80–87, doi:10.4204/eptcs.20.9 | 6 |
abstract. we prove that abelian subgroups of the outer automorphism group of a free group are quasiisometrically embedded. our proof uses recent developments in the theory of train track maps by feighnhandel. as an application, we prove the rank conjecture for out(fn ). | 4 |
abstract
catroid is a free and open source visual programming language,
programming environment, image manipulation program, and
website. catroid allows casual and first-time users starting from
age eight to develop their own animations and games solely using
their android phones or tablets. catroid also allows to wire... | 6 |
abstract
the map-reduce computing framework rose to prominence with datasets of such size that dozens
of machines on a single cluster were needed for individual jobs. as datasets approach the exabyte
scale, a single job may need distributed processing not only on multiple machines, but on multiple
clusters. we consider... | 8 |
abstract
the propagation of sound in a shallow water environment is characterized by boundary reflections from the sea surface and sea floor.
these reflections result in multiple (indirect) sound propagation
paths, which can degrade the performance of passive sound source
localization methods. this paper proposes the u... | 7 |
abstract
we consider the ransac algorithm in the context of subspace recovery and subspace clustering. we derive some theory and perform some numerical experiments. we also draw some
correspondences with the methods of hardt and moitra (2013) and chen and lerman (2009b). | 10 |
abstraction of a physical sensing device
b
located at position p and running program p . module m is the collection
of methods that the sensor makes available for internal and for external usage. typically this collection of methods may be interpreted as the library of
functions of the tiny operating system installed i... | 2 |
abstract—filtering and smoothing algorithms for linear
discrete-time state-space models with skew-t-distributed measurement noise are presented. the presented algorithms use a
variational bayes based posterior approximation with coupled
location and skewness variables to reduce the error caused by
the variational appro... | 3 |
abstract
in this paper, a discrete-time multi-agent system is presented which is formulated in terms of the
delta operator. the proposed multi-agent system can unify discrete-time and continuous-time multi-agent
systems. in a multi-agent network, in practice, the communication among agents is acted upon by various
fact... | 3 |
abstract
we give sufficient identifiability conditions for estimating mixing proportions in two-component mixtures of skew normal distributions with one known component. we consider the
univariate case as well as two multivariate extensions: a multivariate skew normal distribution (msn) by azzalini and dalla valle (199... | 10 |
abstract: the shear strength and stick-slip behavior of a rough rock joint are analyzed using the | 5 |
abstract
for σ an orientable surface of finite topological type having genus
at least 3 (possibly closed or possibly with any number of punctures
or boundary components), we show that the mapping class group
m od(σ) has no faithful linear representation in any dimension over
any field of positive characteristic. | 4 |
abstract. in this work we propose a heuristic algorithm for the layout optimization for disks installed in
a rotating circular container. this is a unequal circle packing problem with additional balance constraints.
it proved to be an np-hard problem, which justifies heuristics methods for its resolution in larger insta... | 5 |
abstract
a rack on [n] can be thought of as a set of maps (fx )x∈[n] , where each
fx is a permutation of [n] such that f(x)fy = fy−1 fx fy for all x and y. in
2013, blackburn showed that the number of isomorphism classes of racks
2
2
on [n] is at least 2(1/4−o(1))n and at most 2(c+o(1))n , where c ≈ 1.557;
2
in this pa... | 4 |
abstract
this paper discusses minimum distance estimation method in the linear regression
model with dependent errors which are strongly mixing. the regression parameters are
estimated through the minimum distance estimation method, and asymptotic distributional properties of the estimators are discussed. a simulation ... | 10 |
abstract. programs that process data that reside in files are widely
used in varied domains, such as banking, healthcare, and web-traffic analysis. precise static analysis of these programs in the context of software
verification and transformation tasks is a challenging problem. our key
insight is that static analysis... | 6 |
abstract
integer-forcing source coding has been proposed as a low-complexity method for compression of distributed correlated
gaussian sources. in this scheme, each encoder quantizes its observation using the same fine lattice and reduces the result
modulo a coarse lattice. rather than directly recovering the individua... | 7 |
abstract
the classical-input quantum-output (cq) wiretap channel is a communication model involving a classical sender x, a legitimate quantum receiver b, and a quantum eavesdropper e.
the goal of a private communication protocol that uses such a channel is for the sender x to
transmit a message in such a way that the ... | 7 |
abstract—the world is connected through the internet. as the
abundance of internet users connected into the web and the
popularity of cloud computing research, the need of artificial
intelligence (ai) is demanding. in this research, genetic algorithm (ga) as ai optimization method through natural selection
and genetic ... | 6 |
abstract—smartphone applications designed to track human
motion in combination with wearable sensors, e.g., during physical exercising, raised huge attention recently. commonly, they
provide quantitative services, such as personalized training instructions or the counting of distances. but qualitative monitoring
and as... | 1 |
abstractions for high-performance remote data access,
mechanisms for scalable data replication, cataloging with rich semantic and syntactic information, data discovery, distributed monitoring, and web-based portals for using the system.
keywords—climate modeling, data management, earth system
grid (esg), grid computing... | 5 |
abstract—modern dense flash memory devices operate at
very low error rates, which require powerful error correcting
coding (ecc) techniques. an emerging class of graph-based ecc
techniques that has broad applications is the class of spatiallycoupled (sc) codes, where a block code is partitioned into
components that are... | 7 |
abstract. let g be a finite group and, for a prime p, let s be a sylow p-subgroup of g. a
character χ of g is called sylp -regular if the restriction of χ to s is the character of the regular
representation of s. if, in addition, χ vanishes at all elements of order divisible by p, χ is said
to be steinberg-like. for ev... | 4 |
abstract
we present bounded dynamic (but observer-free) output feedback laws
that achieve global stabilization of equilibrium profiles of the partial
differential equation (pde) model of a simplified, age-structured
chemostat model. the chemostat pde state is positive-valued, which
means that our global stabilization i... | 3 |
abstract
this paper studies a pursuit-evasion problem involving a single pursuer and a single evader, where we are interested in developing
a pursuit strategy that doesn’t require continuous, or even periodic, information about the position of the evader. we propose
a self-triggered control strategy that allows the pur... | 3 |
abstract. in this article we explore an algorithm for diffeomorphic
random sampling of nonuniform probability distributions on riemannian manifolds. the algorithm is based on optimal information transport
(oit)—an analogue of optimal mass transport (omt). our framework
uses the deep geometric connections between the fi... | 10 |
abstract
this paper presents the development of an adaptive algebraic multiscale solver for
compressible flow (c-ams) in heterogeneous porous media. similar to the recently
developed ams for incompressible (linear) flows [wang et al., jcp, 2014], c-ams
operates by defining primal and dual-coarse blocks on top of the fi... | 5 |
abstract
numerical simulation of compressible fluid flows is performed using the euler equations. they include the scalar advection equation for the density, the
vector advection equation for the velocity and a given pressure dependence on
the density. an approximate solution of an initial–boundary value problem is
cal... | 5 |
abstract. formal concept analysis and its associated conceptual structures have been used to support exploratory search through conceptual
navigation. relational concept analysis (rca) is an extension of formal concept analysis to process relational datasets. rca and its multiple interconnected structures represent goo... | 2 |
abstract
a research frontier has emerged in scientific computation, wherein discretisation error
is regarded as a source of epistemic uncertainty that can be modelled. this raises several
statistical challenges, including the design of statistical methods that enable the coherent
propagation of probabilities through a ... | 10 |
abstract and
talk (mcdonnell et al., 2017).
10
imagenet32 4x
imagenet32 10x
imagenet32 15x
cifar-100 4x
cifar-100 10x
cifar-10
svhn
mnist
imagenet single crop
imagenet multi-crop
bwn on imagenet | 9 |
abstract
today’s javascript applications are composed of scripts from different origins that are loaded at
run time. as not all of these origins are equally trusted, the execution of these scripts should
be isolated from one another. however, some scripts must access the application state and some
may be allowed to cha... | 6 |
abstract
let n (n) denote the number of isomorphism types of groups of order n. we
consider the integers n that are products of at most 4 not necessarily distinct primes
and exhibit formulas for n (n) for such n. | 4 |
abstract
we consider the action of an irreducible outer automorphism φ on the
closure of culler–vogtmann outer space. this action has north-south
dynamics and so, under iteration, points converge exponentially to [t+φ ].
for each n ≥ 3, we give a family of outer automorphisms φk ∈
out(fn ) such that as, k goes to infin... | 4 |
abstract—distribution grid is the medium and low voltage part
of a large power system. structurally, the majority of distribution
networks operate radially, such that energized lines form a
collection of trees, i.e. forest, with a substation being at the root of
any tree. the operational topology/forest may change from... | 3 |
abstract. let k be a discretly henselian field whose residue field is separably
closed. answering a question raised by g. prasad, we show that a semisimple k–
group g is quasi-split if and only if it quasi–splits after a finite tamely ramified
extension of k. | 4 |
abstract
the idea that there are any large-scale trends in the evolution of biological organisms is
highly controversial. it is commonly believed, for example, that there is a large-scale trend in
evolution towards increasing complexity, but empirical and theoretical arguments undermine
this belief. natural selection r... | 5 |
abstract—machine learning models are frequently used to
solve complex security problems, as well as to make decisions in sensitive situations like guiding autonomous vehicles
or predicting financial market behaviors. previous efforts have
shown that numerous machine learning models were vulnerable
to adversarial manipu... | 9 |
abstract. we give a characterization for asymptotic dimension growth. we
apply it to cat(0) cube complexes of finite dimension, giving an alternative proof
of n. wright’s result on their finite asymptotic dimension. we also apply our new
characterization to geodesic coarse median spaces of finite rank and establish
tha... | 4 |
abstract
we consider the problem of density estimation on riemannian manifolds. density
estimation on manifolds has many applications in fluid-mechanics, optics and
plasma physics and it appears often when dealing with angular variables (such as
used in protein folding, robot limbs, gene-expression) and in general dire... | 10 |
abstract
we show that memcapacitive (memory capacitive) systems can be used as synapses in artificial neural
networks. as an example of our approach, we discuss the architecture of an integrate-and-fire neural
network based on memcapacitive synapses. moreover, we demonstrate that the spike-timing-dependent
plasticity c... | 9 |
abstract
let g be an n-node simple directed planar graph with nonnegative edge weights. we
study the fundamental problems of computing (1) a global cut of g with minimum weight
and (2) a cycle of g with minimum weight. the best previously known algorithm for the
former problem, running in o(n log3 n) time, can be obtai... | 8 |
abstract
a shortest-path algorithm finds a path containing the minimal cost between two vertices in a
graph. a plethora of shortest-path algorithms is studied in the literature that span across multiple
disciplines. this paper presents a survey of shortest-path algorithms based on a taxonomy that is
introduced in the p... | 8 |
abstract— we present an event-triggered control strategy
for stabilizing a scalar, continuous-time, time-invariant, linear
system over a digital communication channel having bounded
delay, and in the presence of bounded system disturbance. we
propose an encoding-decoding scheme, and determine lower
bounds on the packet... | 3 |
abstract. we define tate-betti and tate-bass invariants for modules over a commutative noetherian local ring r. then we show
the periodicity of these invariants provided that r is a hypersurface. in case r is also gorenstein, we see that a finitely generated
r-module m and its matlis dual have the same tate-betti and
t... | 0 |
abstract—this paper studies the performance of sparse regression codes for lossy compression with the squared-error distortion
criterion. in a sparse regression code, codewords are linear
combinations of subsets of columns of a design matrix. it is shown
that with minimum-distance encoding, sparse regression codes
achi... | 7 |
abstract. motivated by the common academic problem of allocating papers to
referees for conference reviewing we propose a novel mechanism for solving the
assignment problem when we have a two sided matching problem with preferences from one side (the agents/reviewers) over the other side (the objects/papers)
and both s... | 2 |
abstract
we propose a new estimator of a discrete monotone probability
mass function with known flat regions. we analyse its asymptotic
properties and compare its performance to the grenander estimator
and to the monotone rearrangement estimator. | 10 |
abstract— we consider the problem of dense depth prediction
from a sparse set of depth measurements and a single rgb
image. since depth estimation from monocular images alone is
inherently ambiguous and unreliable, to attain a higher level of
robustness and accuracy, we introduce additional sparse depth
samples, which ... | 2 |
abstract
estimating the entropy based on data is one of the prototypical problems in distribution
property testing and estimation. for estimating the shannon entropy of a distribution on s
elements with independent samples, [pan04] showed that the sample complexity is sublinear in
s, and [vv11a] showed that consistent ... | 10 |
abstract
the paper investigates the computational problem of predicting rna secondary
structures. the general belief is that allowing pseudoknots makes the problem hard.
existing polynomial-time algorithms are heuristic algorithms with no performance guarantee and can only handle limited types of pseudoknots. in this p... | 5 |
abstract
in this paper, we further develop the approach, originating in [26], to “computation-friendly”
statistical estimation via convex programming.our focus is on estimating a linear or quadratic
form of an unknown “signal,” known to belong to a given convex compact set, via noisy indirect
observations of the signal... | 10 |
abstract
we study nonconvex finite-sum problems and analyze stochastic variance reduced gradient
(svrg) methods for them. svrg and related methods have recently surged into prominence for
convex optimization given their edge over stochastic gradient descent (sgd); but their theoretical analysis almost exclusively assum... | 9 |
abstract
a template-based generic programming approach was presented in a previous paper [19]
that separates the development effort of programming a physical model from that of computing
additional quantities, such as derivatives, needed for embedded analysis algorithms. in this
paper, we describe the implementation de... | 5 |
abstract
blomer and naewe [bn09] modified the randomized sieving algorithm of ajtai, kumar and
sivakumar [aks01] to solve the shortest vector problem (svp). the algorithm starts with
n = 2o(n) randomly chosen vectors in the lattice and employs a sieving procedure to iteratively
obtain shorter vectors in the lattice. th... | 8 |
abstract. we present a method for computing the table of marks of a direct product
of finite groups. in contrast to the character table of a direct product of two finite groups,
its table of marks is not simply the kronecker product of the tables of marks of the two
groups. based on a decomposition of the inclusion ord... | 4 |
abstract
if x, y, z denote sets of random variables, two different data sources may contain
samples from px,y and py,z , respectively. we argue that causal inference can help
inferring properties of the ‘unobserved joint distributions’ px,y,z or px,z . the properties
may be conditional independences (as in ‘integrative... | 10 |
abstract
the constrained lcs problem asks one to find a longest common subsequence of two input strings
a and b with some constraints. the str-ic-lcs problem is a variant of the constrained lcs
problem, where the solution must include a given constraint string c as a substring. given two strings
a and b of respective l... | 8 |
abstract
let (r, m) be a noetherian local ring, e the injective hull of k = r/m and m ◦ =
homr (m, e) the matlis dual of the r-module m. if the canonical monomorphism ϕ :
m → m ◦◦ is surjective, m is known to be called (matlis-)reflexive. with the help of the
bass numbers µ(p, m) = dimκ(p) (homr (r/p, m)p ) of m with r... | 0 |
abstract
the ability to use inexpensive, noninvasive sensors to accurately classify flying insects would have significant
implications for entomological research, and allow for the development of many useful applications in vector
control for both medical and agricultural entomology. given this, the last sixty years ha... | 5 |
abstract | 8 |
abstract. in the context of the genome-wide association studies (gwas), one has to solve
long sequences of generalized least-squares problems; such a task has two limiting factors:
execution time –often in the range of days or weeks– and data management –data sets in
the order of terabytes. we present an algorithm that... | 5 |
abstract. finite rank median spaces are a simultaneous generalisation
of finite dimensional cat(0) cube complexes and real trees. if γ is an
irreducible lattice in a product of rank one simple lie groups, we show
that every action of γ on a complete, finite rank median space has
a global fixed point. this is in sharp c... | 4 |
abstract—in this paper, we compare the performance of two
main mimo techniques, beamforming and multiplexing, in the
terahertz (thz) band. the main problem with the thz band is
its huge propagation loss, which is caused by the tremendous
signal attenuation due to molecule absorption of the electromagnetic wave. to over... | 7 |
abstract. an algorithm to decide the emptiness of a regular type expression with set operators given a set of parameterised type definitions
is presented. the algorithm can also be used to decide the equivalence
of two regular type expressions and the inclusion of one regular type expression in another. the algorithm s... | 6 |
abstract—the allan variance (av) is a widely used quantity
in areas focusing on error measurement as well as in the general
analysis of variance for autocorrelated processes in domains
such as engineering and, more specifically, metrology. the form
of this quantity is widely used to detect noise patterns and
indication... | 10 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.