text
stringlengths
27
153
label
stringlengths
27
153
id
int64
0
40k
problem We event the address specific of video retrieval.
We address the problem of specific video event retrieval.
14,200
This offers in complexity localizes videos. of parts gain significant a matching accurately the and
This offers a significant gain in complexity and accurately localizes the matching parts of videos.
14,201
is decompressing descriptors. case, without the this performed video retrieval In
In this case, video retrieval is performed without decompressing the descriptors.
14,202
of a of We alignment videos. consider set the temporal also
We also consider the temporal alignment of a set of videos.
14,203
given enables global synchronous videos scene. of the a alignment playback The of temporal
The global temporal alignment enables synchronous playback of the videos of a given scene.
14,204
Variational for scalable a technique inference inference. is Bayesian approximate
Variational inference is a scalable technique for approximate Bayesian inference.
14,205
difficult algorithms requires to automate. calculations; it makes Deriving this variational tedious model-specific inference
Deriving variational inference algorithms requires tedious model-specific calculations; this makes it difficult to automate.
14,206
automatic (ADVI). variational variational inference differentiation algorithm, propose an automatic We inference
We propose an automatic variational inference algorithm, automatic differentiation variational inference (ADVI).
14,207
a a only Bayesian provides The and dataset; else. model user nothing
The user only provides a Bayesian model and a dataset; nothing else.
14,208
a of no make assumptions We class and conjugacy models. support broad
We make no conjugacy assumptions and support a broad class of models.
14,209
variational the appropriate and variational objective. automatically algorithm The an family optimizes determines
The algorithm automatically determines an appropriate variational family and optimizes the variational objective.
14,210
a Stan implement ADVI We available now), (code programming in probabilistic framework.
We implement ADVI in Stan (code available now), a probabilistic programming framework.
14,211
a train million the mixture We images. quarter model on
We train the mixture model on a quarter million images.
14,212
in we variational model use inference With ADVI on any Stan. write we can
With ADVI we can use variational inference on any model we write in Stan.
14,213
new data of brought The challenges scale Bayesian has inference. modern to
The modern scale of data has brought new challenges to Bayesian inference.
14,214
are computationally particular, algorithms conventional In large expensive very sets. data for MCMC
In particular, conventional MCMC algorithms are computationally very expensive for large data sets.
14,215
are Existing EP-MCMC algorithms approximation accuracy resampling. in and by limited difficulty
Existing EP-MCMC algorithms are limited by approximation accuracy and difficulty in resampling.
14,216
a that problems. new In solves EP-MCMC these propose this PART article, we algorithm
In this article, we propose a new EP-MCMC algorithm PART that solves these problems.
14,217
illustrating theoretical provide and extensive We justification empirical performance. experiments
We provide theoretical justification and extensive experiments illustrating empirical performance.
14,218
present new We object YOLO, a to detection. approach
We present YOLO, a new approach to object detection.
14,219
detection perform work repurposes on object to Prior detection. classifiers
Prior work on object detection repurposes classifiers to perform detection.
14,220
Finally, learns representations general YOLO objects. of very
Finally, YOLO learns very general representations of objects.
14,221
the vehicle. to Recognition Systems are License number used license Plate plate of determine a
License Plate Recognition Systems are used to determine the license plate number of a vehicle.
14,222
recognize number system uses the Optical Recognition current The mainly to Character plate.
The current system mainly uses Optical Character Recognition to recognize the number plate.
14,223
this There are to several system. problems
There are several problems to this system.
14,224
applications (IoT). include Internet Things of under several Practical areas
Practical applications include several areas under Internet of Things (IoT).
14,225
revolution virus. possibility eradicating to the therapeutic consider of This us leads
This therapeutic revolution leads us to consider possibility of eradicating the virus.
14,226
cascade is required. of for However, care this, effective an
However, for this, an effective cascade of care is required.
14,227
difficult achieve. will eradication However, to be
However, eradication will be difficult to achieve.
14,228
English. for the of specifically designed ideas, are However, majority algorithms systems and existing
However, majority of the existing ideas, algorithms and systems are specifically designed for English.
14,229
are directions promising research future discussed. for Moreover,
Moreover, promising directions for future research are discussed.
14,230
Current empirical lack such demonstrate methods, but impressive Bayesian Quadrature, performance analysis. as theoretical
Current methods, such as Bayesian Quadrature, demonstrate impressive empirical performance but lack theoretical analysis.
14,231
to challenge important An convergence guarantees. probabilistic rigorous reconcile integrators these with is
An important challenge is to reconcile these probabilistic integrators with rigorous convergence guarantees.
14,232
state-of-the-art and FWBQ In competitive optimisation. simulations, with Frank-Wolfe out-performs methods alternatives based is on
In simulations, FWBQ is competitive with state-of-the-art methods and out-performs alternatives based on Frank-Wolfe optimisation.
14,233
harmful, demanding involving a precise making. are decision events Emergency fire and potentially fast
Emergency events involving fire are potentially harmful, demanding a fast and precise decision making.
14,234
There models. color-based using for are video methods fire on detection several
There are several methods for fire detection on video using color-based models.
14,235
addressed question The how has extensively. humans been problem solve of
The question of how humans solve problem has been addressed extensively.
14,236
overlooked. seems study the effectiveness of process of the to However, this be direct
However, the direct study of the effectiveness of this process seems to be overlooked.
14,237
or forces show Results that to become rescaling. to sparse multiplicative either weights noise invariant
Results show that multiplicative noise forces weights to become either sparse or invariant to rescaling.
14,238
a almost in science common and disciplines. is Sphere all engineering fitting problem
Sphere fitting is a common problem in almost all science and engineering disciplines.
14,239
are Most methods in behavior. of iterative available
Most of methods available are iterative in behavior.
14,240
how other with popular some behaves. and comparison this methods method also have shown We
We have also shown some comparison with other popular methods and how this method behaves.
14,241
are approximations gradient. two costs efficient novel by Computational this reduced to
Computational costs are reduced by two novel efficient approximations to this gradient.
14,242
setups wide in challenging problem. baseline Finding is a correspondences
Finding correspondences in wide baseline setups is a challenging problem.
14,243
integrates novel a deformation method a introduce We that model.
We introduce a novel method that integrates a deformation model.
14,244
function a its optimization. further employ majorization-minimization and We robust for matching utilize cost for
We further utilize a robust cost function for matching and employ majorization-minimization for its optimization.
14,245
more existing maps Our accurate than that approaches. significantly experiments finds indicate our method
Our experiments indicate that our method finds significantly more accurate maps than existing approaches.
14,246
starting zero deploy goal system with a to high-accuracy training Our examples. is
Our goal is to deploy a high-accuracy system starting with zero training examples.
14,247
the over model improves As decreases. queries the on reliance crowdsourcing time,
As the model improves over time, the reliance on crowdsourcing queries decreases.
14,248
and on sentiment We tested image approach three datasets---named-entity our recognition, classification, classification.
We tested our approach on three datasets---named-entity recognition, sentiment classification, and image classification.
14,249
part learning. form process a probabilistic Gaussian models core of machine (GP)
Gaussian process (GP) models form a core part of probabilistic machine learning.
14,250
paper each be this available replicate in experiment shortly. will to Code
Code to replicate each experiment in this paper will be available shortly.
14,251
useful Such an is projection. invariance is but photography unique perspective to in
Such an invariance is useful in photography but is unique to perspective projection.
14,252
extend We model to also slopes of analysis lines. our
We also extend our analysis to model slopes of lines.
14,253
We catadioptric and XSlit using our XSlit mirrors. real cameras, analyses validate panoramas,
We validate our analyses using real XSlit cameras, XSlit panoramas, and catadioptric mirrors.
14,254
efficient approach real to in simulation. enough interactive run rates time at our is Besides,
Besides, our approach is efficient enough to run at interactive rates in real time simulation.
14,255
In there the debate mechanisms Saccharomyces cerevisiae, underlying is an ongoing important this regarding asymmetry.
In Saccharomyces cerevisiae, there is an ongoing debate regarding the mechanisms underlying this important asymmetry.
14,256
suggested. in progress partial for AGI is A measure
A measure for partial progress in AGI is suggested.
14,257
reasoning fundamental grounded proposed. on Based is a ability, that system Abstract
Abstract Based on that fundamental ability, a grounded reasoning system is proposed.
14,258
trouble developments. real-time been its large has a However, to most complexity computational
However, its large computational complexity has been a trouble to most real-time developments.
14,259
this The past growing decade seen a in interest process. has automating
The past decade has seen a growing interest in automating this process.
14,260
approach automatic is proposed novel paper, of a hybrid for In this detection landmarks. cephalometric
In this paper, a novel hybrid approach is proposed for automatic detection of cephalometric landmarks.
14,261
on those which edges. to tracing suggested landmarks located are is predict Edge method
Edge tracing method is suggested to predict those landmarks which are located on edges.
14,262
least named last but estimation. the method not analysis The based is
The last but not the least method is named analysis based estimation.
14,263
directly. relations a Therefore desired the estimating the in has suggested method novelty third
Therefore the third suggested method has a novelty in estimating the desired relations directly.
14,264
individual used Deep in a recognize of scene. networks people are actions to the
Deep networks are used to recognize the actions of individual people in a scene.
14,265
a step inference probabilistic mimics refinement message-passing step to in a similar model. graphical This
This refinement step mimics a message-passing step similar to inference in a probabilistic graphical model.
14,266
more The that informative. the model other is tree for is clusters representing
The other is that the tree model for representing clusters is more informative.
14,267
find method activations as embedding an uses images. Neural similar Convolutional semantically The Network to
The method uses Convolutional Neural Network activations as an embedding to find semantically similar images.
14,268
typical based unigram images, is on the these From frequencies. most selected caption
From these images, the most typical caption is selected based on unigram frequencies.
14,269
can and in work the verification modes. identification Furthermore, scheme both
Furthermore, the scheme can work in both identification and verification modes.
14,270
linear our call We response (LRVB). method variational Bayes
We call our method linear response variational Bayes (LRVB).
14,271
posterior. about the make no Indeed, the form assumptions of true we
Indeed, we make no assumptions about the form of the true posterior.
14,272
low canonical in machine multidimensional problem a in Learning data structure is learning. dimensional of
Learning of low dimensional structure in multidimensional data is a canonical problem in machine learning.
14,273
matrix we algorithm In online compute this to factorizations. propose paper, an
In this paper, we propose an online algorithm to compute matrix factorizations.
14,274
The dictionary algorithm matrix. low-rank to updates performs
The algorithm performs low-rank updates to dictionary matrix.
14,275
We for algorithm extend further handling the missing data.
We extend the algorithm further for handling missing data.
14,276
and series online simulated The in data. tasks time evaluated real-world forecasting is method on
The method is evaluated in online time series forecasting tasks on simulated and real-world data.
14,277
trees and phylogenetic (MUL-trees). a multi-labelled relationship close networks There between is
There is a close relationship between phylogenetic networks and multi-labelled trees (MUL-trees).
14,278
in $F$ properties In $U$ operations the more detail. of paper, we study this and
In this paper, we study properties of the operations $U$ and $F$ in more detail.
14,279
To analogue of develop a do graph we phylogenetic this, fibrations.
To do this, we develop a phylogenetic analogue of graph fibrations.
14,280
way to coarse gives arguments. compare a This
This gives a coarse way to compare arguments.
14,281
and convergence. properties: well-behaved two We that show model counting our normalization has
We show that our counting model has two well-behaved properties: normalization and convergence.
14,282
theory with phenomenology are programmed consistent death. both show that Here and we
Here we show that both theory and phenomenology are consistent with programmed death.
14,283
dynamics. is complicated with true domains large especially in This
This is especially true in large domains with complicated dynamics.
14,284
prove policy. this bootstrapping near-optimal a process returns that We
We prove that this bootstrapping process returns a near-optimal policy.
14,285
results representations. policies learned without in with skills requiring policy complex planning better Thus,
Thus, planning with learned skills results in better policies without requiring complex policy representations.
14,286
for DTRN Codes the be will available.
Codes for the DTRN will be available.
14,287
work action recognition video. This targets in human
This work targets human action recognition in video.
14,288
descriptor of tracks The body along human appearance and motion aggregates parts. information
The descriptor aggregates motion and appearance information along tracks of human body parts.
14,289
We Cooking method and and challenging JHMDB recent MPII our datasets. evaluate on the
We evaluate our method on the recent and challenging JHMDB and MPII Cooking datasets.
14,290
consistent of For shows the the method datasets both improvement state our over art.
For both datasets our method shows consistent improvement over the state of the art.
14,291
from more verification, is much face face Different identification demanding.
Different from face verification, face identification is much more demanding.
14,292
The SNR is using method. the eigenvalue computed
The SNR is computed using the eigenvalue method.
14,293
of to The a is algorithm our pair only input images. stereo
The only input to our algorithm is a pair of stereo images.
14,294
network to We appearance classes. deep extract semantic for features use neural a the
We use a deep neural network to extract the appearance features for semantic classes.
14,295
in urban Our Daimler scene competing dataset. method approaches other outperforms segmentation
Our method outperforms other competing approaches in Daimler urban scene segmentation dataset.
14,296
semantic architecture using a network heterogeneous propose neural annotations. semi-supervised We for segmentation novel deep
We propose a novel deep neural network architecture for semi-supervised semantic segmentation using heterogeneous annotations.
14,297
paper, the imaging problem is addressed. pulsed of this reconstruction In and terahertz
In this paper, the problem of terahertz pulsed imaging and reconstruction is addressed.
14,298
for sparsity-inducing this A approach purpose. is proposed
A sparsity-inducing approach is proposed for this purpose.
14,299