text stringlengths 27 153 | label stringlengths 27 153 | id int64 0 40k |
|---|---|---|
cluster Siberian populations Paleo-Eskimos. related We to Kets established to that the of the belong | We established that the Kets belong to the cluster of Siberian populations related to Paleo-Eskimos. | 14,900 |
to varying optical flow solve a consider problem with method variational We the illumination. | We consider a variational method to solve the optical flow problem with varying illumination. | 14,901 |
of The parallelism solver MUMPS. level second massively uses the parallel | The second level of parallelism uses the massively parallel solver MUMPS. | 14,902 |
This procedure on the Gibbs built using relies algorithm particle a sampler. split-merge flexible | This algorithm relies on a flexible split-merge procedure built using the particle Gibbs sampler. | 14,903 |
important molecular interaction models class are networks. networks Boolean an of for computational | Boolean networks are an important class of computational models for molecular interaction networks. | 14,904 |
This networks. control of role molecular the work in Boolean studies of the canalization | This work studies the role of canalization in the control of Boolean molecular networks. | 14,905 |
seamlessly into reality the to art objects Augmented fuse ones. is real virtual | Augmented reality is the art to seamlessly fuse virtual objects into real ones. | 14,906 |
effective, very choices. design involve many they user-defined Albeit | Albeit very effective, they involve many user-defined design choices. | 14,907 |
network can learn? the ", "what and | ", and "what can the network learn? | 14,908 |
augmentation. using show renderings can when for overall improve that We performance image data | We show that overall performance can improve when using image renderings for data augmentation. | 14,909 |
many problem computer a low-level Image interesting long-standing vision applications. restoration in with is | Image restoration is a long-standing problem in low-level computer vision with many interesting applications. | 14,910 |
Reaction TNRD -- \textit{Trainable this Nonlinear approach We call Diffusion}. | We call this approach TNRD -- \textit{Trainable Nonlinear Reaction Diffusion}. | 14,911 |
matter satisfactory resolve existing not a view, way. our do solutions in the In this | In our view, the existing solutions do not resolve this matter in a satisfactory way. | 14,912 |
the most fast transform. utilizes of and approach elegant efficient Fourier One the | One of the most elegant and efficient approach utilizes the fast Fourier transform. | 14,913 |
paper the In problem describe give this solution. satisfactory we a and | In this paper we describe the problem and give a satisfactory solution. | 14,914 |
probability a There of models is implementing third practicing. way and | There is a third way of implementing probability models and practicing. | 14,915 |
This questions in of to observables. is answer terms put | This is to answer questions put in terms of observables. | 14,916 |
eliminates testing and frequentist eliminates also hypothesis This factors and Bayes it estimation. parameter | This eliminates frequentist hypothesis testing and Bayes factors and it also eliminates parameter estimation. | 14,917 |
stated verifiable fashion, publicly in as predictions. All are models | All models are stated in publicly verifiable fashion, as predictions. | 14,918 |
into put models is process any trust All a them. verification must before undergo | All models must undergo a verification process before any trust is put into them. | 14,919 |
convex hill climbing problems. is guarantied is to only method that for a L-BFGS converge | L-BFGS is a hill climbing method that is guarantied to converge only for convex problems. | 14,920 |
solving difficult with results L-BFGS. nice works by very obtain such problems Some | Some works obtain very nice results by solving such difficult problems with L-BFGS. | 14,921 |
which In to techniques be regime, known algorithms sub-sampling effective. this utilize are | In this regime, algorithms which utilize sub-sampling techniques are known to be effective. | 14,922 |
algorithm us develop select which also to its allows near-optimal analysis parameters. theoretical We | We develop its theoretical analysis which also allows us to select near-optimal algorithm parameters. | 14,923 |
We how to problems. demonstrate results well-known our apply machine learning | We demonstrate how our results apply to well-known machine learning problems. | 14,924 |
several various scenarios. we under our the on datasets of Lastly, performance evaluate algorithm | Lastly, we evaluate the performance of our algorithm on several datasets under various scenarios. | 14,925 |
miRNAs essential post-transcriptional various crucial in fate cell as regulators decision. serve | miRNAs serve as crucial post-transcriptional regulators in various essential cell fate decision. | 14,926 |
However, the bistability not is mutual mRNA-miRNA contribution the to understood. of regulation fully | However, the contribution of the mRNA-miRNA mutual regulation to bistability is not fully understood. | 14,927 |
stronger region a competing bistability mRNA by expanded (ceRNA). Second, is of the | Second, the region of bistability is expanded by a stronger competing mRNA (ceRNA). | 14,928 |
importance in demonstrated regulation reciprocal cell the fate mRNA-miRNA decision. simple Thus, of we | Thus, we demonstrated the importance of simple mRNA-miRNA reciprocal regulation in cell fate decision. | 14,929 |
paper, this Common series. Fuzzy In propose matching we Longest time Subsequence for | In this paper, we propose Fuzzy Longest Common Subsequence matching for time series. | 14,930 |
is semantic human regions analysis. into body Parsing crucial to human-centric | Parsing human body into semantic regions is crucial to human-centric analysis. | 14,931 |
that a explores human paper, propose segment-based parsing this i.e. information, pipeline pose In we | In this paper, we propose a segment-based parsing pipeline that explores human pose information, i.e. | 14,932 |
are though of proposed Graph. the Finally, the an inferred segments ensemble part And-Or best | Finally, the best ensemble of the proposed part segments are inferred though an And-Or Graph. | 14,933 |
data objective data major of Uncovering causal is in a analytics. relationships | Uncovering causal relationships in data is a major objective of data analytics. | 14,934 |
with e.g. experiments, Causal normally designed are discovered relationships | Causal relationships are normally discovered with designed experiments, e.g. | 14,935 |
many cases. or be conducted randomised which, expensive infeasible in to controlled are however trials, | randomised controlled trials, which, however are expensive or infeasible to be conducted in many cases. | 14,936 |
develop In have tree causal paper, decision nodes a we this where interpretations. causal | In this paper, we develop a causal decision tree where nodes have causal interpretations. | 14,937 |
signals method data sets. finding practical for in causal The large is | The method is practical for finding causal signals in large data sets. | 14,938 |
machine computational in representations major advantages. learning ubiquitous Factored and to are lead | Factored representations are ubiquitous in machine learning and lead to major computational advantages. | 14,939 |
probabilistic large a representation. show of models a class compact have We Fourier that graphical | We show that a large class of probabilistic graphical models have a compact Fourier representation. | 14,940 |
approximating a up result opens probability of distribution. an theoretical This entirely new way | This theoretical result opens up an entirely new way of approximating a probability distribution. | 14,941 |
the demonstrate the this applying variable by significance elimination to We approach algorithm. of it | We demonstrate the significance of this approach by applying it to the variable elimination algorithm. | 14,942 |
representation the traditional inference with significant obtain Compared other approximate bucket algorithms, we improvements. and | Compared with the traditional bucket representation and other approximate inference algorithms, we obtain significant improvements. | 14,943 |
distribution. model finger vein the using a user We Gaussian | We model the user finger vein using a Gaussian distribution. | 14,944 |
a results on state-of-the-art that SDUMLA-HMT perform algorithm benchmark. show our Experimental like | Experimental results show that our algorithm perform like a state-of-the-art on SDUMLA-HMT benchmark. | 14,945 |
also may useful results timescales. It relatively on deliver short | It may also deliver useful results on relatively short timescales. | 14,946 |
become has Internet concept. popular a culture, development of the cuteness With | With the development of Internet culture, cuteness has become a popular concept. | 14,947 |
about what Many look factors person are making a curious cute. people | Many people are curious about what factors making a person look cute. | 14,948 |
this rare However, answer there question. to research is interesting | However, there is rare research to answer this interesting question. | 14,949 |
prediction. effectiveness cuteness method the proposed Extensive evaluations the validate for of | Extensive evaluations validate the effectiveness of the proposed method for cuteness prediction. | 14,950 |
The applicable approach without is multi-class to any and binary proposed both modification. problems | The proposed approach is applicable to both binary and multi-class problems without any modification. | 14,951 |
investigations preliminary Our both existed. that suggest | Our preliminary investigations suggest that both existed. | 14,952 |
inform of animals modern-day examples discussions chirality. We our exhibit exterior that throughout with | We inform our discussions throughout with examples of modern-day animals that exhibit exterior chirality. | 14,953 |
of assumptions it these Here proven that is is neither correct. | Here it is proven that neither of these assumptions is correct. | 14,954 |
networks. encoded with of principles combinatorics inconsistent bounded of are They fundamental | They are inconsistent with fundamental principles of combinatorics of bounded encoded networks. | 14,955 |
MAP We the from also posterior learn ascent. solution by gradient the | We also learn the MAP solution from the posterior by gradient ascent. | 14,956 |
We classification temporal performance. constraints significantly that improve the show | We show that temporal constraints significantly improve the classification performance. | 14,957 |
always reverse relationships the imply causal but The is associations, not is, true. problem | The problem is, causal relationships imply associations, but the reverse is not always true. | 14,958 |
However here. can see paradigms the between two the synergy we | However we can see the synergy between the two paradigms here. | 14,959 |
notion provide formalisms of Many some solution. these of | Many of these formalisms provide some notion of solution. | 14,960 |
for a which the counterexamples. on provide formalization theorem we Unfortunately, relies | Unfortunately, the formalization relies on a theorem for which we provide counterexamples. | 14,961 |
are values. low a power sparsity The at by approximated law distributions closely | The distributions are closely approximated by a power law at low sparsity values. | 14,962 |
Model This a proposes Subdivision-Fusion (SFM) recognize to human novel actions. paper | This paper proposes a novel Subdivision-Fusion Model (SFM) to recognize human actions. | 14,963 |
action distribution In feature tasks, is most leading overfitting. to common overlapping a problem recognition | In most action recognition tasks, overlapping feature distribution is a common problem leading to overfitting. | 14,964 |
SFM, clustered. the subdivision are proposed in of stage In the category samples each | In the subdivision stage of the proposed SFM, samples in each category are clustered. | 14,965 |
more multiple Then, grouped are into samples concentrated subcategories. such | Then, such samples are grouped into multiple more concentrated subcategories. | 14,966 |
for subcategories as overfitting and easier avoided. are the find to is Boundaries consequence | Boundaries for the subcategories are easier to find and as consequence overfitting is avoided. | 14,967 |
number to Two clusters methods of provided. determine the are | Two methods to determine the number of clusters are provided. | 14,968 |
popular has tested proposed The been thoroughly datasets. model with four | The proposed model has been thoroughly tested with four popular datasets. | 14,969 |
systems described utilizing are analogies. often Living informational | Living systems are often described utilizing informational analogies. | 14,970 |
completion an learn of problem image. to the missing The is tag tags of | The problem of tag completion is to learn the missing tags of an image. | 14,971 |
our the is of ICONIP. version This on paper preprint | This is the preprint version of our paper on ICONIP. | 14,972 |
of boundaries. important An detection the neuronal is reconstruction for computation | An important computation for reconstruction is the detection of neuronal boundaries. | 14,973 |
a gain in innovations. achieve Here three substantial we accuracy through | Here we achieve a substantial gain in accuracy through three innovations. | 14,974 |
deep We features. face based Deformable detection present algorithm and on Models a Part pyramidal | We present a face detection algorithm based on Deformable Part Models and deep pyramidal features. | 14,975 |
the also we that Furthermore, regularizer of restoration images. can benefit show general natural this | Furthermore, we show that this regularizer can also benefit the restoration of general natural images. | 14,976 |
the aspects company. important one is a Warehouse of of | Warehouse is one of the important aspects of a company. | 14,977 |
parameter generates backtracking First, it from solutions algorithm. a tree | First, it generates a solutions parameter tree from backtracking algorithm. | 14,978 |
for system. warehouse an method attractive proved This solution is be alternative layout to | This method is proved to be an attractive alternative solution for warehouse layout system. | 14,979 |
these We approach into compare", while account. taking an propose "learns that to difficulties | We propose an approach that "learns to compare", while taking these difficulties into account. | 14,980 |
the paradigm. maximum trained with The likelihood network is | The network is trained with the maximum likelihood paradigm. | 14,981 |
presents in significantly terms convergence. a PISAA improved performance of | PISAA presents a significantly improved performance in terms of convergence. | 14,982 |
be parallel PISAA available. if environments can computing implemented in | PISAA can be implemented in parallel computing environments if available. | 14,983 |
reconstructed The variety imaging. x-ray to of than medical be is broader materials | The variety of materials to be reconstructed is broader than medical x-ray imaging. | 14,984 |
to achieve algorithms require computations may results. in iterative quantitatively However, order accurate | However, iterative algorithms may require computations in order to achieve quantitatively accurate results. | 14,985 |
increase in approaches the convergence. are proposed to literature many speed of There | There are many approaches proposed in the literature to increase speed of convergence. | 14,986 |
Initially, around surrogate coefficients approximation only. are created functions | Initially, surrogate functions are created around approximation coefficients only. | 14,987 |
studies number air and of a have with dealt Recently, pollution. quality air | Recently, a number of studies have dealt with air quality and air pollution. | 14,988 |
should in any software JavaScript, The SVG. run that browser web HTML, supports modern and | The software should run in any web browser that supports modern JavaScript, HTML, and SVG. | 14,989 |
release version. The is new every stable of updated with a manual | The manual is updated with every release of a new stable version. | 14,990 |
on Collective interactions. to cell cell-cell cues responses depend exogenous | Collective cell responses to exogenous cues depend on cell-cell interactions. | 14,991 |
can enhanced stimuli. in and noisy result to these In sensitivity principle, weak | In principle, these can result in enhanced sensitivity to weak and noisy stimuli. | 14,992 |
as of problem We similarity regularized pose learning. hashing a learning | We pose hashing learning as a problem of regularized similarity learning. | 14,993 |
accepted our a marked several performance baselines approach increase. Comparing against demonstrates | Comparing our approach against several accepted baselines demonstrates a marked performance increase. | 14,994 |
based hierarchy model image is The partitions. a of first on | The first model is based on a hierarchy of image partitions. | 14,995 |
are integrated final saliency The a partitions different the obtained maps then for into map. | The maps obtained for the different partitions are then integrated into a final saliency map. | 14,996 |
saliency produce the We maps. that proposed show models high quality | We show that the proposed models produce high quality saliency maps. | 14,997 |
performance evaluation datasets. benchmark two achieve several state-of-the-art Objective that methods in the demonstrates | Objective evaluation demonstrates that the two methods achieve state-of-the-art performance in several benchmark datasets. | 14,998 |
given for models There tissue. are stochastic a risk numerous cancer for | There are numerous stochastic models for cancer risk for a given tissue. | 14,999 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.