text
stringlengths
27
153
label
stringlengths
27
153
id
int64
0
40k
are DMA both the than We approach. also that easier approaches computationally show
We also show that both approaches are computationally easier than the DMA approach.
4,700
Consequently, for category. been each models have different proposed
Consequently, different models have been proposed for each category.
4,701
algorithm efficient an propose utility. estimation possibility for based of We expected qualitative
We propose an efficient algorithm for estimation of possibility based qualitative expected utility.
4,702
their to images is challenging owing Segmentation a complexity. task medical of
Segmentation of medical images is a challenging task owing to their complexity.
4,703
is this an subset Finding setting in optimal tests in intractable of general.
Finding an optimal subset of tests in this setting is intractable in general.
4,704
to iteration value our (point-based) algorithm. also We improvements recent heuristic discuss search
We also discuss recent improvements to our (point-based) heuristic search value iteration algorithm.
4,705
domains. Traditional lack the to expressive languages probabilistic handle relational power
Traditional probabilistic languages lack the expressive power to handle relational domains.
4,706
but a lacks capability. plausible first-order expressive, reasoning Classical sufficiently logic coherent is
Classical first-order logic is sufficiently expressive, but lacks a coherent plausible reasoning capability.
4,707
the inspired Paramount the by using present an StarTrek. example Series logic We
We present the logic using an example inspired by the Paramount Series StarTrek.
4,708
approximate large We fast for matching. propose graph algorithm a
We propose a fast approximate algorithm for large graph matching.
4,709
The test of the linear the representation. size in complexity the is of
The complexity of the test is linear in the size of the representation.
4,710
population handles data and important problems association in estimation. AI, including It
It handles important problems in AI, including data association and population estimation.
4,711
to with concepts these matching. We demonstrate citation application
We demonstrate these concepts with application to citation matching.
4,712
DMS/SHAPE and give small CMCT additional reactivities data Integrating including improvements.
Integrating DMS/SHAPE data and including CMCT reactivities give small additional improvements.
4,713
probabilistic consider Traditional sequences, symbols flat of only. sequences models however, of
Traditional probabilistic models of sequences, however, consider sequences of flat symbols only.
4,714
have hidden Logical models proposed one as Markov solution. been
Logical hidden Markov models have been proposed as one solution.
4,715
over logical sequences of alphabet atoms. sequences, with logical an i.e., They deal
They deal with logical sequences, i.e., sequences over an alphabet of logical atoms.
4,716
model a problem. more This the complex at selection of expense comes
This comes at the expense of a more complex model selection problem.
4,717
levels abstraction explored. different have Indeed, to be
Indeed, different abstraction levels have to be explored.
4,718
effectiveness. convergence that show We provide SAGEM's and experimental results
We provide convergence and experimental results that show SAGEM's effectiveness.
4,719
such is In inference many addition, applications, inherently in uncertain.
In addition, in many applications, such inference is inherently uncertain.
4,720
the theory, probability uncertainty. Based the we on representation define of associated
Based on probability theory, we define the representation of the associated uncertainty.
4,721
system enable to active results These uncertainty. handle such any
These results enable any active system to handle such uncertainty.
4,722
inappropriate (e.g. use causes Possible the of include sensors
Possible causes include the use of inappropriate sensors (e.g.
4,723
looking a accumulate inaccuracies laser through (e.g. sensor glass walls),
a laser looking through glass walls), sensor inaccuracies accumulate (e.g.
4,724
dynamically static grid objects). with moving used a occupancy
a static occupancy grid used with dynamically moving objects).
4,725
increases find structure diagnostic best step to accuracy. that the This aims
This step aims to find the best structure that increases diagnostic accuracy.
4,726
very the of the encouraging The discussed results obtained . end at paper are
The very encouraging results obtained are discussed at the end of the paper .
4,727
method of can improve The the original the algorithm. mentioned weaknesses mean-shift proposed
The proposed method can improve the mentioned weaknesses of the original mean-shift algorithm.
4,728
The performance case algorithm from is using test illustrated this new of the a literature.
The performance of this new algorithm is illustrated using a test case from the literature.
4,729
able We are report results. promising to
We are able to report promising results.
4,730
the the addition, a of numerical properties of estimator. we provide study In statistical
In addition, we provide a numerical study of the statistical properties of the estimator.
4,731
Consequently, agent. a the protocol has formaldehyde-free devised, as carbohydrazide been developing using staining
Consequently, a formaldehyde-free staining protocol has been devised, using carbohydrazide as the developing agent.
4,732
much of retained the showed and increased peptide sensitivity This coverage staining. protocol silver
This protocol showed much increased peptide coverage and retained the sensitivity of silver staining.
4,733
number Change, global This like IncreasingNValue. important subsumes of a meta-constraint Smooth constraints and
This meta-constraint subsumes a number of important global constraints like Change, Smooth and IncreasingNValue.
4,734
combining Borda the results used weighted three The for methods. is method of
The weighted Borda method is used for combining the results of three methods.
4,735
the of approach. shows An proposed the example applicability
An example shows the applicability of the proposed approach.
4,736
initiated, chronic of modulation the with inflammation function. leads immune Once to obesity associated cell
Once initiated, chronic inflammation associated with obesity leads to the modulation of immune cell function.
4,737
planned pre-diabetic was and two into The study using model. obese mouse groups
The study was planned into two groups using obese and pre-diabetic mouse model.
4,738
correction in viz. A immunological important noteworthy readouts
A noteworthy immunological correction in important readouts viz.
4,739
a indeed, especially challenging is, variations. the recognition and illumination pose task, face under Human
Human face recognition is, indeed, a challenging task, especially under the illumination and pose variations.
4,740
are show pose illumination variations. features transformed shape and robust that Experiments such to
Experiments show that such transformed shape features are robust to illumination and pose variations.
4,741
Comparison proposed superior. algorithms are the shows
Comparison shows the proposed algorithms are superior.
4,742
Relating certain matched. patterns, a be can correlation quickly above a noise threshold with value,
Relating noise patterns, with a correlation above a certain threshold value, can quickly be matched.
4,743
is images quality the objective Therefore, spatial an resolution of for assessment fusion required.
Therefore, an objective quality of the spatial resolution assessment for fusion images is required.
4,744
effect of Arabic. for Language tools the using describes Processing Natural (NLP) learning It
It describes the effect of using Natural Language Processing (NLP) tools for learning Arabic.
4,745
indexed particular The technique employment explored is the of corpora. in pedagogically case this
The technique explored in this particular case is the employment of pedagogically indexed corpora.
4,746
architecture Agent. Operator Parameter Agent three and of agents: of types User Agent, consists Our
Our architecture consists of three types of agents: User Agent, Operator Agent and Parameter Agent.
4,747
process We using probit priors. (GP) probabilistic multinomial classification Gaussian consider
We consider probabilistic multinomial probit classification using Gaussian process (GP) priors.
4,748
Such data. common require to to patterns methods recognize analyze
Such methods require to recognize common patterns to analyze data.
4,749
a The of most often manual work consuming very process. is inpainting time
The manual work of inpainting is most often a very time consuming process.
4,750
of automatic this is faster. and to digitalization technique, Due it
Due to digitalization of this technique, it is automatic and faster.
4,751
in compared longer trials Response to latency correct was trials. error
Response latency was longer in correct trials compared to error trials.
4,752
dimensionality component feature is a linear reduction for analysis popular (PCA) tool extraction. and Principal
Principal component analysis (PCA) is a popular tool for linear dimensionality reduction and feature extraction.
4,753
kernel we review ideas of first paper, this PCA PCA. In the basic and
In this paper, we first review the basic ideas of PCA and kernel PCA.
4,754
the for PCA. Then reconstruction kernel of on we focus pre-images
Then we focus on the reconstruction of pre-images for kernel PCA.
4,755
face it the ASMs, and construct also use kernel models. We human implement PCA-based to
We also implement the kernel PCA-based ASMs, and use it to construct human face models.
4,756
a Markov our Networks Logic natural logic-based formalism. candidate are for
Markov Logic Networks are a natural candidate for our logic-based formalism.
4,757
we show overcome assumptions and these under can what We how problems.
We show how and under what assumptions we can overcome these problems.
4,758
Hodgkin-Huxley of giant model axon no bistability. squid The the shows
The Hodgkin-Huxley model of the squid giant axon shows no bistability.
4,759
values the for two sets. between parameter to transitions analyze varied the We model parameter
We varied parameter values for the model to analyze transitions between the two parameter sets.
4,760
the show bistability Na+ of characterizes that inactivation primarily We the current.
We show that bistability primarily characterizes the inactivation of the Na+ current.
4,761
the is environmental chloride an that system. Cadmium affects reproductive toxic male Background:
Background: Cadmium chloride is an environmental toxic that affects the male reproductive system.
4,762
and transferrin. able and Zinc strengthen TJ was chloride to AJ, decrease
Zinc chloride was able to strengthen TJ and AJ, and decrease transferrin.
4,763
Key AJ, . prostate, Testis words: TJ, cadmium, zinc, immunohistochemistry
Key words: Testis prostate, cadmium, zinc, TJ, AJ, immunohistochemistry .
4,764
complete-data Under analyse likelihood the cluster of function we Gaussian models. assumptions, weighted
Under Gaussian assumptions, we analyse the complete-data likelihood function of cluster weighted models.
4,765
direction. that Furthermore, array elevation systems of the is larger in than lateral resolution linear
Furthermore, the elevation resolution of linear array systems is larger than that in lateral direction.
4,766
degrades asymmetry arrays. This linear images using obtained C-scan
This asymmetry degrades C-scan images obtained using linear arrays.
4,767
ones. comparison the yielded the This with in other best result filter
This filter yielded the best result in comparison with the other ones.
4,768
reference complicated models. These values as serve statistical for results more
These results serve as reference values for more complicated statistical models.
4,769
depends their critical. However, parameters is on parameters their the determining and performance strongly
However, their performance strongly depends on their parameters and determining the parameters is critical.
4,770
applied algorithm our We the to Tempering. Parallel
We applied our algorithm to the Parallel Tempering.
4,771
adaptive tunes on developed we that That the is, Tempering the Parallel fly. parameters
That is, we developed adaptive Parallel Tempering that tunes the parameters on the fly.
4,772
potential usually and cons Each of choice strengths. various pros has
Each potential choice has usually pros and cons of various strengths.
4,773
The VFC not cube accuracy be three-dimensionally. can in of rotated even guaranteed
The accuracy of VFC can not be guaranteed even in cube rotated three-dimensionally.
4,774
time Both size of in CFD. proportional to algorithms run the the
Both algorithms run in time proportional to the size of the CFD.
4,775
Case approach neurological been comparisons vs to diseases. classical control have of the the study
Case vs control comparisons have been the classical approach to the study of neurological diseases.
4,776
most However, group. fall will either patients into cleanly not
However, most patients will not fall cleanly into either group.
4,777
models intermediate that the brain function describe requires To the interpolate disease between states.
To describe the intermediate brain function requires models that interpolate between the disease states.
4,778
measures Our distribution of of incorporate models e.g. activation, spatial
Our models incorporate spatial distribution of measures of activation, e.g.
4,779
behavioural fMRI Disease GPs phenotypes applied Alzheimer's We e.g. model across (AD) image to measures,
We applied GPs to model fMRI image phenotypes across Alzheimer's Disease (AD) behavioural measures, e.g.
4,780
obtained MMSE/ACE scores, and non-observed at values. predictions
scores, and obtained predictions at non-observed MMSE/ACE values.
4,781
support algorithms. to efficient information and construct less require reasoning models Such
Such models require less information to construct and support efficient reasoning algorithms.
4,782
The combines with networks framework graphical representation. networks, and the belief semantics constraint defining
The framework combines belief networks with constraint networks, defining the semantics and graphical representation.
4,783
filters. non-linear Stack case filters special are of a
Stack filters are a special case of non-linear filters.
4,784
a Boolean image which Each filtered function, filter. is by the binary characterizes then
Each binary image is then filtered by a Boolean function, which characterizes the filter.
4,785
propose problem, a we annealing-based algorithm, MAP To simulated this AnnealedMAP algorithm. address
To address this problem, we propose AnnealedMAP algorithm, a simulated annealing-based MAP algorithm.
4,786
this tested We Bayesian algorithm real several networks. on
We tested this algorithm on several real Bayesian networks.
4,787
The to can approach families of construction be other applied problems. same
The same approach can be applied to other families of construction problems.
4,788
characterize terms in called expressions in algebraic of networks We Bayesian quasi-probabilities. probabilities
We characterize probabilities in Bayesian networks in terms of algebraic expressions called quasi-probabilities.
4,789
improve Quasi-probabilities probabilistic easily are manipulated to the efficiency of inference.
Quasi-probabilities are easily manipulated to improve the efficiency of probabilistic inference.
4,790
expected total policy minimizes optimal diagnostic cost. the An
An optimal diagnostic policy minimizes the expected total cost.
4,791
as this Markov diagnosis Decision formalize Process a We (MDP). process
We formalize this diagnosis process as a Markov Decision Process (MDP).
4,792
learn process. for Bayesian diagnosis We assume not a network the nor do
We do not learn nor assume a Bayesian network for the diagnosis process.
4,793
Regularizers control the speed developed overfitting search. are to up and
Regularizers are developed to control overfitting and speed up the search.
4,794
overfitting systematic that search. integrates research This the is into first prevention
This research is the first that integrates overfitting prevention into systematic search.
4,795
describe Processes an We Markov state structure approach Decision exploiting with continuous in for variables.
We describe an approach for exploiting structure in Markov Decision Processes with continuous state variables.
4,796
describe piecewise We representations. constant the for first algorithm
We first describe the algorithm for piecewise constant representations.
4,797
representation generally axioms of the independence. upon of independence relations semigraphoid well-known builds The
The representation of independence relations generally builds upon the well-known semigraphoid axioms of independence.
4,798
of of to capture this knowledge. We monotonicity two concepts define type
We define two concepts of monotonicity to capture this type of knowledge.
4,799