text
stringlengths
27
153
label
stringlengths
27
153
id
int64
0
40k
the Thereby tractography. for subsequent we as input FOD improve
Thereby we improve the FOD as input for subsequent tractography.
14,400
Additionally rendered viewpoints. we show images from novel
Additionally we show images rendered from novel viewpoints.
14,401
individuals. is in interacting populations evolution game theory powerful framework for of studying Evolutionary a
Evolutionary game theory is a powerful framework for studying evolution in populations of interacting individuals.
14,402
combining model energies, regularization propose new We common e.g. a segmentation
We propose a new segmentation model combining common regularization energies, e.g.
14,403
combining balanced motion, image depth, texture, clustering color, features of arbitrary high-dimensional enforcing etc. location,
enforcing balanced clustering of arbitrary high-dimensional image features combining color, texture, location, depth, motion, etc.
14,404
an Precision example system. application as considered is the agriculture for
Precision agriculture is considered as an example application for the system.
14,405
also surveillance are increasing. So for the need techniques
So the need for surveillance techniques are also increasing.
14,406
the detect system in developed a motion has to been The video.
The system has been developed to detect the motion in a video.
14,407
video. from system, In motion the or real this the is time webcam from detected
In this system, motion is detected from the webcam or from the real time video.
14,408
detect been method differencing used moving to target. Background frames the subtraction has and
Background subtraction and frames differencing method has been used to detect the moving target.
14,409
difference method continuous two Similarly, difference frames two frames. takes between
Similarly, two frames difference method takes difference between two continuous frames.
14,410
and difference thresholded is difference pixels resultant is Then frame that amount of the calculated.
Then that resultant difference frame is thresholded and the amount of difference pixels is calculated.
14,411
low stochastic Furthermore, us with enables approximation the to cost. computational optimize method a problem
Furthermore, a stochastic approximation method enables us to optimize the problem with low computational cost.
14,412
asymptotically is estimated by also parameter We and show distributed. consistent normally SLSTD the
We also show the parameter estimated by SLSTD is consistent and asymptotically normally distributed.
14,413
has studied for decades. Face been Recognition many
Face Recognition has been studied for many decades.
14,414
occluders object significantly recognition accuracy. presence The of impacts
The presence of occluders significantly impacts object recognition accuracy.
14,415
when run on parallel try architectures. are we efficiently heterogeneous These challenges to compounded
These challenges are compounded when we try to run efficiently on heterogeneous parallel architectures.
14,416
that common, libraries relational Different implemented data model. geometric unified, domains as are use a
Different geometric domains are implemented as libraries that use a common, unified, relational data model.
14,417
via explained features spectral The intuitive circulant are of matrices. use
The intuitive use of spectral features are explained via circulant matrices.
14,418
number a The results labeling and with experiments are substantial computation. reported of recognition
The recognition results are reported with a substantial number of experiments and labeling computation.
14,419
compute algorithm, correspondences to We a between novel called images. dense matching DeepMatching, introduce
We introduce a novel matching algorithm, called DeepMatching, to compute dense correspondences between images.
14,420
performance obtains public on DeepFlow benchmarks optical estimation. for competitive flow
DeepFlow obtains competitive performance on public benchmarks for optical flow estimation.
14,421
however, of is, implementation these The computationally challenging. ideas
The implementation of these ideas is, however, computationally challenging.
14,422
significant Finding predictive important task. features statistically interaction high-order modeling but in challenging is
Finding statistically significant high-order interaction features in predictive modeling is important but challenging task.
14,423
where PSI. sampling distributions authors exact the for framework algorithmic in presented an computing
where the authors presented an algorithmic framework for computing exact sampling distributions in PSI.
14,424
we in general. Then under yield conditions give should which results method good our
Then we give conditions under which our method should yield good results in general.
14,425
compare method methods. this other we our context with two In
In this context we compare our method with two other methods.
14,426
inference is Bayesian spectral presented. approach A to
A spectral approach to Bayesian inference is presented.
14,427
the emulation pursues probability of posterior the It density.
It pursues the emulation of the posterior probability density.
14,428
of likelihood be quantities can From calculated statistical interest expansion semi-analytically. this all spectral
From this spectral likelihood expansion all statistical quantities of interest can be calculated semi-analytically.
14,429
the and Both expansion to the moments are model evidence coefficients. related posterior the
Both the model evidence and the posterior moments are related to the expansion coefficients.
14,430
enables to performance high The complex real-time queries. responses
The high performance enables real-time responses to complex queries.
14,431
are signal (i.e. then of a as decomposed of The sum the signals projected interest
The projected signals are then decomposed as the sum of a signal of interest (i.e.
14,432
model. Gaussian linear very discriminant) noise, and mixed using simple background a
discriminant) and background noise, using a very simple Gaussian linear mixed model.
14,433
is simplified. parameter the problem simplicity model, to the estimation Thanks of the corresponding
Thanks to the simplicity of the model, the corresponding parameter estimation problem is simplified.
14,434
of context. Classification relevance proposed prove approach the a in results such the
Classification results prove the relevance of the proposed approach in such a context.
14,435
for image attracts years. in minimization processing low-rank attention much recent Patch-based
Patch-based low-rank minimization for image processing attracts much attention in recent years.
14,436
we denoising. low-rank propose image a patch-based idea, Based on minimization method this for
Based on this idea, we propose a patch-based low-rank minimization method for image denoising.
14,437
main The three and stated is process PCA, way: SVD equivalent denoising in low-rank minimization.
The main denoising process is stated in three equivalent way: PCA, SVD and low-rank minimization.
14,438
this method are also improvements given. Further of
Further improvements of this method are also given.
14,439
an has structure. typically underlying communication Human
Human communication typically has an underlying structure.
14,440
accomplish this language joint both in generative a visual using cues We and model.
We accomplish this using both visual and language cues in a joint generative model.
14,441
is chemical broad ways. than The more models two model in kinetics typical
The model is more broad than typical chemical kinetics models in two ways.
14,442
First, faithful. more of simplifies time-dependent process the models hazard using making rates
First, using time-dependent hazard rates simplifies the process of making models more faithful.
14,443
includes state environmental the the resources. of traits use and individual of Second, system
Second, the state of the system includes individual traits and use of environmental resources.
14,444
where in of multi-modal is sampler illustrated are The encountered. proposed distributions efficiency examples the
The efficiency of the proposed sampler is illustrated in examples where multi-modal distributions are encountered.
14,445
powerful hidden sequential of modeling tools are data. Factorial (FHMMs) Markov models
Factorial hidden Markov models (FHMMs) are powerful tools of modeling sequential data.
14,446
log-likelihood than the marginal approximation a of we better FAB First, inference. previous offer
First, we offer a better approximation of marginal log-likelihood than the previous FAB inference.
14,447
No the the face between were two area. found groups in differences
No differences between the two groups were found in the face area.
14,448
gray showed groups. Structural difference analysis in imaging matter no density between
Structural imaging analysis showed no difference in gray matter density between groups.
14,449
signature: motion based This temporal on lines. for barcode a improvement new is
This improvement is based on a new temporal signature: motion barcode for lines.
14,450
statistical has systematic The little however. performance received of these sophisticated relatively models attention,
The statistical performance of these sophisticated models has received relatively little systematic attention, however.
14,451
cohesive do subsets related this form most display Nonetheless, genes (clusters). implies they phylogenies; topologically
Nonetheless, most genes do display topologically related phylogenies; this implies they form cohesive subsets (clusters).
14,452
The take successive up may days. entire three process
The entire process may take up three successive days.
14,453
space the This constitutes neophobia, avoidance space. behavior of coping untrodden with
This behavior constitutes coping with space neophobia, the avoidance of untrodden space.
14,454
often task Solving computer for real-time is optimization on-the-fly difficult applications. a large-scale graphics
Solving large-scale optimization on-the-fly is often a difficult task for real-time computer graphics applications.
14,455
technique. is reduction well-adopted model tackle To a this challenge,
To tackle this challenge, model reduction is a well-adopted technique.
14,456
high-order problems. among account regression practical covariates into many interactions valuable in is Taking
Taking into account high-order interactions among covariates is valuable in many practical regression problems.
14,457
bending. cyclization into gain insight DNA a DNA technique nature to is the powerful of
DNA cyclization is a powerful technique to gain insight into the nature of DNA bending.
14,458
the FRET recent in j-factor also We experiments. measured estimate dynamic
We also estimate the dynamic j-factor measured in recent FRET experiments.
14,459
of the described. regions inter-individual was The brain graphs within and variability discovered different
The inter-individual variability of the graphs within different brain regions was discovered and described.
14,460
Experiments challenging conducted state-of-the-art. a dataset with on outperforming are results
Experiments are conducted on a challenging dataset with results outperforming state-of-the-art.
14,461
size of processing. is a image any color for Firstly input
Firstly a color image of any size is input for processing.
14,462
The it to converts a algorithm grayscale image.
The algorithm converts it to a grayscale image.
14,463
apply foreground to detector the boundary edge canny of we find the object. Next
Next we apply canny edge detector to find the boundary of the foreground object.
14,464
to is Video a video context. stepping segmentation stone understanding
Video segmentation is a stepping stone to understanding video context.
14,465
human presence environments. is to automatically important detect times secure in It at
It is at times important to detect human presence automatically in secure environments.
14,466
robust, shape fast that has rates. a error needs This low and recognition algorithm is
This needs a shape recognition algorithm that is robust, fast and has low error rates.
14,467
the is error encouraged. sity is the and minimized reconstruction this coefficient objective, spar- In
In this objective, the reconstruction error is minimized and the coefficient spar- sity is encouraged.
14,468
algorithm. an alternative an strategy by in This objective opti- is mized iterative
This objective is opti- mized by an alternative strategy in an iterative algorithm.
14,469
Almost all predictions. computations making neural involve
Almost all neural computations involve making predictions.
14,470
the demonstrate datasets. BMA number of clustering use model-based We for of in a
We demonstrate the use of BMA in model-based clustering for a number of datasets.
14,471
can BMA the in context enhanced Applying modeling performance. fast give is and model-based
Applying BMA in the model-based context is fast and can give enhanced modeling performance.
14,472
ubiquitous machine in learning. are methods tools Kernel
Kernel methods are ubiquitous tools in machine learning.
14,473
that show large classification be We used regression scale for tasks. framework this and can
We show that this framework can be used for large scale regression and classification tasks.
14,474
configurations. the can viewed latent prior FIC over a variable be distribution as
FIC can be viewed as a prior distribution over the latent variable configurations.
14,475
result, towards components. may models be As a with less FIC biased overly
As a result, FIC may be overly biased towards models with less components.
14,476
There Satisfiability the for are Modulo already a tools quite problems. Theories (SMT) solving few
There are already quite a few tools for solving the Satisfiability Modulo Theories (SMT) problems.
14,477
solution integer convex solving with extends and The tool volume counting computation/estimation SMT polytopes. for
The tool extends SMT solving with integer solution counting and volume computation/estimation for convex polytopes.
14,478
interpretations, Based al. the on structure SE et Delgrande of
Based on the structure of SE interpretations, Delgrande et al.
14,479
well-known revision. logic adapted AGM the to (LP) framework program
adapted the well-known AGM framework to logic program (LP) revision.
14,480
identified introduced They of specific behavior rational revision LP operators. some and the
They identified the rational behavior of LP revision and introduced some specific operators.
14,481
channel an plays river role studies. in networks of Quantitative important analysis
Quantitative analysis of channel networks plays an important role in river studies.
14,482
experimental several fitness completely the last In landscapes have years, been resolved.
In the last years, several experimental fitness landscapes have been completely resolved.
14,483
etc). fraction roughness/slope, components, non-additive of of peaks, number
number of peaks, roughness/slope, fraction of non-additive components, etc).
14,484
objects together. formulated aggregated The terrain similar type the by aggregated is ground
The aggregated terrain type is formulated by the similar ground objects aggregated together.
14,485
is triplet-based criterion. learning under a formulated Pose embedding distance
Pose embedding learning is formulated under a triplet-based distance criterion.
14,486
compares parametric with Bayesian system identification. recently This classical for developed paper methods methods
This paper compares classical parametric methods with recently developed Bayesian methods for system identification.
14,487
not posterior distribution so often requires methods. known computational and analytically, The is
The posterior distribution is not often known analytically, and so requires computational methods.
14,488
supervision transfers propose In from work a technique images different that we modalities. this between
In this work we propose a technique that transfers supervision between images from different modalities.
14,489
the immune model computational simulates a We of the development adaptive have system. built that
We have built a computational model that simulates the development of the adaptive immune system.
14,490
show realistic. model simulations self-centered The our is that
The simulations show that our self-centered model is realistic.
14,491
state of detail. analyzed special is The steady case in case
The special case of steady state case is analyzed in detail.
14,492
problems, a new energy which we parsimonious call We discrete minimization of labeling. family propose
We propose a new family of discrete energy minimization problems, which we call parsimonious labeling.
14,493
and energy Specifically, clique potentials. high-order functional unary potentials of consists our
Specifically, our energy functional consists of unary potentials and high-order clique potentials.
14,494
for small each of component. number a labelings, putative with mixture one us This provides
This provides us with a small number of putative labelings, one for each mixture component.
14,495
putative of energy we the in Third, the labeling best choose terms value.
Third, we choose the best putative labeling in terms of the energy value.
14,496
process fault in Gaussian This approach a data. novel paper to proposes time-series removal
This paper proposes a novel Gaussian process approach to fault removal in time-series data.
14,497
on prediction error This based approach minimization. identification the guarantees stable predictors the of
This approach guarantees the identification of stable predictors based on the prediction error minimization.
14,498
this we compare issue. this paper various In address propose to techniques and
In this paper we propose and compare various techniques to address this issue.
14,499