text stringlengths 27 153 | label stringlengths 27 153 | id int64 0 40k |
|---|---|---|
with approach. Specifically, beta Bayesian with models deals regression a mixed effects from it | Specifically, it deals with beta regression models with mixed effects from a Bayesian approach. | 3,900 |
done amplitudes be multiresolution with is using that group. shown a analysis It transformation can | It is shown that multiresolution analysis can be done with amplitudes using a transformation group. | 3,901 |
Separation of frequency amplitude facilitated G-lets. low by and is components of high each resolution | Separation of low and high frequency components of each amplitude resolution is facilitated by G-lets. | 3,902 |
Applications face more. extraction, this edge compression, denoising, include feature algorithm and for detection, recognition, | Applications for this algorithm include edge detection, feature extraction, denoising, face recognition, compression, and more. | 3,903 |
an We algorithm as groups using example. dihedral this analyze | We analyze this algorithm using dihedral groups as an example. | 3,904 |
We ECG results the `Lena' an and signal with image. standard the demonstrate | We demonstrate the results with an ECG signal and the standard `Lena' image. | 3,905 |
noise. salt The proposed scheme reduces and pepper efficiently identifies and | The proposed scheme efficiently identifies and reduces salt and pepper noise. | 3,906 |
empirical clustering the an in data, Such corresponds to model ultrametric hierarchical e.g. | Such an ultrametric model corresponds to hierarchical clustering in the empirical data, e.g. | 3,907 |
epidemiological the Some methods other are discussed. of extension systems for | Some extension of the methods for other epidemiological systems are discussed. | 3,908 |
of the approach variations model its This is any and noise against parameters. robust | This approach is robust against any variations of the noise model and its parameters. | 3,909 |
the descent method an We the steepest via algorithm. use solution find iterative sparse to | We use the steepest descent method to find the sparse solution via an iterative algorithm. | 3,910 |
additional frequency was By the obtained. these concerning networks, considering information associations several of | By considering several networks, additional information concerning the frequency of these associations was obtained. | 3,911 |
two algorithm, that, Mau\'a Lauritzen-Nilsson we al. After consider et algorithms, and | After that, we consider two algorithms, Lauritzen-Nilsson algorithm, and Mau\'a et al. | 3,912 |
no proposed feature knowledge approach noise of of prior that the Main is required. | Main feature of the proposed approach is that no prior knowledge of noise required. | 3,913 |
developed Stefan- It law and based Boltzmann is law. on Fourier the | It is developed based on Stefan- Boltzmann law and the Fourier law. | 3,914 |
We investigate advantage computation also approach the load. less that reduction has of noise fast | We also investigate the fast noise reduction approach that has advantage of less computation load. | 3,915 |
reducing reduction comparison This of approach time. has the noise advantage by fast the | This approach has the advantage of fast noise reduction by reducing the comparison time. | 3,916 |
This medicine images applications approach will and Infrared video for conferencing. extend the | This approach will extend the Infrared images applications for medicine and video conferencing. | 3,917 |
This truth-valued concept linguistic lattice. work continuation about paper our research is the of | This paper is the continuation of our research work about linguistic truth-valued concept lattice. | 3,918 |
method Gabor spatiotemporal filters. texture presents This a dynamic based paper for on new recognition | This paper presents a new method for dynamic texture recognition based on spatiotemporal Gabor filters. | 3,919 |
response, calculating each For energy a vector is built by feature statistic. the | For each response, a feature vector is built by calculating the energy statistic. | 3,920 |
are extract to relevant approaches information of shape. a various There | There are various approaches to extract relevant information of a shape. | 3,921 |
comparison database both shape experimental Through a classified, previously methods are compared. using | Through experimental comparison using a shape database previously classified, both methods are compared. | 3,922 |
steps. main two by The described can be proposed method | The proposed method can be described by two main steps. | 3,923 |
the on of based maps. images, brightness possibilities the there variations are produce To several | To produce the variations of images, there are several possibilities based on the brightness maps. | 3,924 |
of functional visibility analogous is the visibility The fringe interference. to the optical | The visibility functional is analogous to the fringe visibility of the optical interference. | 3,925 |
last relabeling by the image this at input CRF with cluster. model the associated Then | Then at last relabeling the input image by the CRF model associated with this cluster. | 3,926 |
presents a approach segment to image This correct and specific information. having label paper | This paper presents a approach to label and segment specific image having correct information. | 3,927 |
modern the thousands in Millions belong of families'. `gene Motivation: genes species only of to | Motivation: Millions of genes in the modern species belong to only thousands of `gene families'. | 3,928 |
and Genes during gained evolution. lost are | Genes are gained and lost during evolution. | 3,929 |
trees is binary specific and Reconciling simple. gene | Reconciling binary gene and specific trees is simple. | 3,930 |
studied gene species is reconciliation non-binary in and binary refinement tree a model. Here, | Here, non-binary gene and species tree reconciliation is studied in a binary refinement model. | 3,931 |
two current context the makes In contributions. this paper | In this context the current paper makes two contributions. | 3,932 |
in and (RNNs) neuroscience networks learning neural widely applications. are used machine Recurrent computational | Recurrent neural networks (RNNs) are widely used in computational neuroscience and machine learning applications. | 3,933 |
equations generative this we derive update that Bayesian output. Given can model, RNN decode its | Given this generative RNN model, we derive Bayesian update equations that can decode its output. | 3,934 |
scheme implements inputs. coding dynamic Furthermore, for a predictive it | Furthermore, it implements a predictive coding scheme for dynamic inputs. | 3,935 |
the application the online an use the of (i.e. to illustrate decoding We rRNN by | We illustrate the use of the rRNN by an application to the online decoding (i.e. | 3,936 |
This considerably. enables to the compressive measurement us lower rate | This enables us to lower the compressive measurement rate considerably. | 3,937 |
of demonstrate applications effectiveness the these the approach. Together, | Together, these applications demonstrate the effectiveness of the approach. | 3,938 |
outlined. work results shown are Initial future and | Initial results are shown and future work outlined. | 3,939 |
derived into Each a is family image sub-images. of decomposed $f$ | Each image $f$ is decomposed into a family of derived sub-images. | 3,940 |
texture After Gabor enhancing image, the features the attribute computed $v$ descriptors. of are as | After enhancing the texture attribute $v$ of the image, Gabor features are computed as descriptors. | 3,941 |
on with validate two variability. proposed We the approach datasets texture high | We validate the proposed approach on two texture datasets with high variability. | 3,942 |
evaluate our We an important leaf-texture real-world approach on application: analysis. also | We also evaluate our approach on an important real-world application: leaf-texture analysis. | 3,943 |
two methods of suspicious Then have MCCs, been for segmentation investigated. | Then for segmentation of suspicious MCCs, two methods have been investigated. | 3,944 |
adaptive considered are: watershed and segmentation. The methods threshold | The considered methods are: adaptive threshold and watershed segmentation. | 3,945 |
cluster to results framework the new us allows concerning points. proximal prove The | The proximal framework allows us to prove new results concerning the cluster points. | 3,946 |
a first on builds geographical based information. network This road modeled simulation detailed | This simulation first builds a modeled road network based on detailed geographical information. | 3,947 |
populations Transporters and the creates this the of simulation two On Mobiles. agents: the network, | On this network, the simulation creates two populations of agents: the Transporters and the Mobiles. | 3,948 |
circulate the agents vehicles on that embody Mobile network. the | Mobile agents embody the vehicles that circulate on the network. | 3,949 |
Trust Region} {\it update the implementation We using Mor\'{e}'s present algorithm of strategy. an | We present an implementation of the algorithm using Mor\'{e}'s {\it Trust Region} update strategy. | 3,950 |
non-quadratic to inverse applied with problem the Poisson distributed is a data. method For illustration | For illustration the method is applied to a non-quadratic inverse problem with Poisson distributed data. | 3,951 |
essential satisfaction is constraint definition problems. in distinction our The of | The distinction is essential in our definition of constraint satisfaction problems. | 3,952 |
reals. over we application satisfaction As problems treat constraint | As application we treat constraint satisfaction problems over reals. | 3,953 |
significantly numerical of cover and These part large analysis, inequalities. nonlinear equations most a | These cover a large part of numerical analysis, most significantly nonlinear equations and inequalities. | 3,954 |
critical) modeled conditioned branching The a latter by is (supercritical or process. | The latter is modeled by a (supercritical or critical) conditioned branching process. | 3,955 |
settings. classical This paper an an to alternative as these contributes approach | This paper contributes an approach as an alternative to these classical settings. | 3,956 |
a Thresholding in major of binarization images. plays | Thresholding plays a major in binarization of images. | 3,957 |
thresholding and Thresholding can local be categorized into global thresholding. | Thresholding can be categorized into global thresholding and local thresholding. | 3,958 |
is cases, appropriate. binarization thresholding In local with more such | In such cases, binarization with local thresholding is more appropriate. | 3,959 |
the local computational on size. mean the window time Normally depends | Normally the local mean computational time depends on the window size. | 3,960 |
to sum prior processing a technique as integral image mean. uses Our calculate local | Our technique uses integral sum image as a prior processing to calculate local mean. | 3,961 |
involve techniques. calculations standard not deviations other as local of adaptive It in does | It does not involve calculations of standard deviations as in other local adaptive techniques. | 3,962 |
convergence situations, problems. slow some algorithm shows EM In | In some situations, EM algorithm shows slow convergence problems. | 3,963 |
reason that is update parameters possible simultaneously. One standard procedures the | One possible reason is that standard procedures update the parameters simultaneously. | 3,964 |
finite estimation. In focus on paper mixture this we | In this paper we focus on finite mixture estimation. | 3,965 |
In EM, framework, parameters which propose a updates component-wise this the sequentially. we | In this framework, we propose a component-wise EM, which updates the parameters sequentially. | 3,966 |
calculation shows presented here [...]. that The | The calculation presented here shows that [...]. | 3,967 |
two-dimensional an algorithm. accept-reject we design In case, the | In the two-dimensional case, we design an accept-reject algorithm. | 3,968 |
is one in used the segmentation. most image The watershed tools of | The watershed is one of the most used tools in image segmentation. | 3,969 |
over and born We developed time. present concept how is its | We present how its concept is born and developed over time. | 3,970 |
regular have more ribozymes the biggest populations. having rates, Despite smaller the growth | Despite having smaller growth rates, the more regular ribozymes have the biggest populations. | 3,971 |
self-incompatibility still is populations systems maintained debated issue. plant a How are in | How self-incompatibility systems are maintained in plant populations is still a debated issue. | 3,972 |
maintenance studies in the the self-incompatibility. of asexual explored reproduction have of function Other | Other studies have explored the function of asexual reproduction in the maintenance of self-incompatibility. | 3,973 |
by self-incompatibility system heterozygote enhanced small populations. This the in excess was | This heterozygote excess was enhanced by the self-incompatibility system in small populations. | 3,974 |
hardware trade-off detail Large-scale the neuromorphic systems chip level bear and resources. between required typically | Large-scale neuromorphic hardware systems typically bear the trade-off between detail level and required chip resources. | 3,975 |
that be modification saves design, resources would reducing resolution. By a weight synaptic natural | By design, a natural modification that saves resources would be reducing synaptic weight resolution. | 3,976 |
represent hardware-constrained general framework setting a configuring for results synapses. Our and up | Our results represent a general framework for setting up and configuring hardware-constrained synapses. | 3,977 |
for discretization simulations. weight considered We be could to other how backends suggest large-scale dedicated | We suggest how weight discretization could be considered for other backends dedicated to large-scale simulations. | 3,978 |
are and stability. to Additional for speed improvements proposed SURF | Additional improvements to SURF are proposed for speed and stability. | 3,979 |
experimentally tightly studied process Organogenesis that regulated for has been is decades. a | Organogenesis is a tightly regulated process that has been studied experimentally for decades. | 3,980 |
We are limbs, the for studying of development bone. models and kidneys, lungs, mechanistic currently | We are currently studying mechanistic models for the development of limbs, lungs, kidneys, and bone. | 3,981 |
meaning, its i.e. often been While embodiment used trivial has in | While embodiment has often been used in its trivial meaning, i.e. | 3,982 |
A number case studies presented to are illustrate of the concept. | A number of case studies are presented to illustrate the concept. | 3,983 |
concentrated visual animals grasping, perception. and locomotion, are and around and These robots involve | These involve animals and robots and are concentrated around locomotion, grasping, and visual perception. | 3,984 |
will link low-level and between processes the establish sensory-motor we cognition. a Finally, | Finally, we will establish a link between the low-level sensory-motor processes and cognition. | 3,985 |
contexts We reinforcement of competition. several and several analyse algorithms in cooperation | We analyse several reinforcement algorithms in several contexts of cooperation and competition. | 3,986 |
distribution. is by inspired the experimental setting Darwin-Wallace Our recently developed | Our experimental setting is inspired by the recently developed Darwin-Wallace distribution. | 3,987 |
mechanisms complex includes of most developed action. all miRNA known The by model us | The most complex model developed by us includes all known mechanisms of miRNA action. | 3,988 |
from one experimental limiting another. vary can setting to The place | The limiting place can vary from one experimental setting to another. | 3,989 |
of explains the majority existing model reported. controversies This | This model explains the majority of existing controversies reported. | 3,990 |
be in mining examples can typical found Some applications. and genomics web | Some typical examples can be found in web mining and genomics applications. | 3,991 |
results on web obtained mining are datasets. State-of-art benchmark | State-of-art results are obtained on benchmark web mining datasets. | 3,992 |
experiments. models simulate of series from We community perturbation developed dynamics a derived mathematical that | We developed mathematical models that simulate community dynamics derived from a series of perturbation experiments. | 3,993 |
an Forest These in were experiments Atlantic stream. performed | These experiments were performed in an Atlantic Forest stream. | 3,994 |
was press submitted trophic level to of perturbation experiment. two community combinations The three | The three trophic level community was submitted to two combinations of press perturbation experiment. | 3,995 |
the electrical by In level exclusion. was first, trophic the top removed | In the first, the top trophic level was removed by electrical exclusion. | 3,996 |
mechanisms. to were the repeated confidence observed Experiments in times different at increase | Experiments were repeated at different times to increase confidence in the observed mechanisms. | 3,997 |
cascade. the a existence cascading indicated interactions trophic Community of similar to classic responses | Community responses indicated the existence of cascading interactions similar to a classic trophic cascade. | 3,998 |
the successfully of community. qualitative models reproduced The the responses | The models successfully reproduced the qualitative responses of the community. | 3,999 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.