text stringlengths 27 153 | label stringlengths 27 153 | id int64 0 40k |
|---|---|---|
estimation a as We demonstrate its efficiency empirically density method. | We empirically demonstrate its efficiency as a density estimation method. | 10,000 |
search This a algo- paper rithms. paradigm new introduces minimax for game-tree | This paper introduces a new paradigm for minimax game-tree search algo- rithms. | 10,001 |
version a Test MT of procedure. is Pearls memory-enhanced | MT is a memory-enhanced version of Pearls Test procedure. | 10,002 |
search algorithms minimax assessments of simulations. have been on of Most the based | Most of the assessments of minimax search algorithms have been based on simulations. | 10,003 |
to guide is aid. designed a without a vehicle Autopilot system | Autopilot is a system designed to guide a vehicle without aid. | 10,004 |
flight. a in becomes system consistency Autopilot reliability crucial and Thus a of an role | Thus reliability and consistency of an Autopilot system becomes a crucial role in a flight. | 10,005 |
vague Rough Applications containing sets a for of potent data. be can kind such tool | Rough sets can be a potent tool for such kind of Applications containing vague data. | 10,006 |
determination factor an approach using proposes Set paper Consistency towards This Rough Theory. | This paper proposes an approach towards Consistency factor determination using Rough Set Theory. | 10,007 |
through Set evaluated Consistency Theory. Factor using Rough is payloads, these | Consistency Factor is evaluated through these payloads, using Rough Set Theory. | 10,008 |
it perceived solves a SSS*, algorithm. of practical all reformulation making three The drawbacks | The reformulation solves all three perceived drawbacks of SSS*, making it a practical algorithm. | 10,009 |
results. This runs simulation counter published to | This runs counter to published simulation results. | 10,010 |
solving a There of under-determined inverse for are linear number problem. large methods | There are a large number of methods for solving under-determined linear inverse problem. | 10,011 |
have datasets. them of time Many very high large complexity for | Many of them have very high time complexity for large datasets. | 10,012 |
a tackle new problem. Representation Two-Stage method to called this We propose Sparse (TSSR) | We propose a new method called Two-Stage Sparse Representation (TSSR) to tackle this problem. | 10,013 |
approximate concentration its distribution The a exploit to dictionary designed sub-Gaussian property. is to | The dictionary is designed to approximate a sub-Gaussian distribution to exploit its concentration property. | 10,014 |
The over representing coefficients testing encoded are and the are basis coefficients obtained. the final | The testing coefficients are encoded over the basis and the final representing coefficients are obtained. | 10,015 |
Since conducted the is a on reduced. is space, greatly projection sparser runtime much the | Since the projection is conducted on a much sparser space, the runtime is greatly reduced. | 10,016 |
instance provide the proposed realization, for we an TSSR. concrete For | For concrete realization, we provide an instance for the proposed TSSR. | 10,017 |
Statistical author's The program is on work of based Interactions (SMNI). Neocortical in the Mechanics | The program is based on the author's work in Statistical Mechanics of Neocortical Interactions (SMNI). | 10,018 |
other as widely required histograms like windows. and by applied Parzen methods | as required by other widely applied methods like histograms and Parzen windows. | 10,019 |
game-playing optimal trees. build search Hence, appears nearly it programs | Hence, it appears game-playing programs build nearly optimal search trees. | 10,020 |
graph conventional definition the of minimal wrong. However, the is | However, the conventional definition of the minimal graph is wrong. | 10,021 |
graph the just conventional of a minimal is definition left-most The approximation. | The conventional definition of the minimal graph is just a left-most approximation. | 10,022 |
size computationally of Calculating too intensive. minimal the the real is graph | Calculating the size of the real minimal graph is too computationally intensive. | 10,023 |
significantly graph. bound be approximations than it However, minimal show to upper smaller the left-most | However, upper bound approximations show it to be significantly smaller than the left-most minimal graph. | 10,024 |
is widely it programs are that appears as as believed. Hence, game-playing efficiently searching not | Hence, it appears that game-playing programs are not searching as efficiently as is widely believed. | 10,025 |
of search shown reduce them, significantly cutoffs, size. tree is transposition enhanced One to | One of them, enhanced transposition cutoffs, is shown to significantly reduce search tree size. | 10,026 |
Alternative such methods as - maximum the explicitly -- parsimony structure tree account. take into | Alternative methods -- such as maximum parsimony - explicitly take the tree structure into account. | 10,027 |
document spotting like retrieval. obtained entropies are The establishing word equivalence, in useful and applications | The entropies obtained are useful in applications like establishing equivalence, word spotting and document retrieval. | 10,028 |
guide. as this we on of touch our a means debate framing Below, | Below, we touch on this debate as a means of framing our guide. | 10,029 |
usage are on FATIGUE. as The as NNN based case well its study evaluated formalization | The NNN formalization as well as its usage are evaluated based on case study FATIGUE. | 10,030 |
image mostly however, For lacking. deblurring, approaches discriminative have been | For image deblurring, however, discriminative approaches have been mostly lacking. | 10,031 |
discriminative this features suitable is Second, prediction. to variability for construct it difficult quite given | Second, given this variability it is quite difficult to construct suitable features for discriminative prediction. | 10,032 |
our Each cascade i.e. is stage of semi-parametric, | Each stage of our cascade is semi-parametric, i.e. | 10,033 |
parameters depends on the instance-specific restoration it of as blur the the such problem, kernel. | it depends on the instance-specific parameters of the restoration problem, such as the blur kernel. | 10,034 |
model minimization by with train synthetically generated our training loss data. We | We train our model by loss minimization with synthetically generated training data. | 10,035 |
system the we of mutant of strains. study the the under behavior Finally injection | Finally we study the behavior of the system under the injection of mutant strains. | 10,036 |
computing alternative Here, power. with an present classical inspired quantum method a I by | Here, I present an alternative inspired by a classical computing method with quantum power. | 10,037 |
distributed called relies hyperstrings. on This representations special method | This method relies on special distributed representations called hyperstrings. | 10,038 |
cooperation conditional mechanisms are Direct prevent to reciprocity dilemmas. social riding free in and important | Direct reciprocity and conditional cooperation are important mechanisms to prevent free riding in social dilemmas. | 10,039 |
population of the relationships are ecology. one interactions in Predator-prey studied most | Predator-prey relationships are one of the most studied interactions in population ecology. | 10,040 |
potentially higher pathways metabolite concentrations. infeasible to lead that could intermediate Alternative often flux carry | Alternative pathways that could potentially carry higher flux often lead to infeasible intermediate metabolite concentrations. | 10,041 |
The on video content. depends performance algorithm tracking | The tracking algorithm performance depends on video content. | 10,042 |
First Lucas-Tomasi is feature the detection Kanade- (KLT) improved tracking. object using | First the object detection is improved using Kanade- Lucas-Tomasi (KLT) feature tracking. | 10,043 |
tracking This selection evaluation. online by is supported an | This selection is supported by an online tracking evaluation. | 10,044 |
been experimented The approach public has video datasets. three on | The approach has been experimented on three public video datasets. | 10,045 |
model. model relaxation LP between establish a further and our LP conventional bound We the | We further establish a relaxation bound between our LP model and the conventional LP model. | 10,046 |
we of experiments, the method for segmentation. interactive object task our In the demonstrate | In the experiments, we demonstrate our method for the task of interactive object segmentation. | 10,047 |
theory briefly for connections We discuss and existing the between LASSO. selection permutation | We briefly discuss connections between permutation selection and existing theory for the LASSO. | 10,048 |
versions conditions. more Further different could coexistence introduce ecological under models | Further versions could introduce more coexistence models under different ecological conditions. | 10,049 |
genes the entropy. studied and dimension were on Y-chromosome Shannon fractal human All using | All genes on the human Y-chromosome were studied using fractal dimension and Shannon entropy. | 10,050 |
the enriched also sequences lncRNA among were outliers. | lncRNA sequences were also enriched among the outliers. | 10,051 |
entropy; Shannon Keywords: centromeric . dimension; genes; gene degredation; lncRNA di-nucleotide Y-chromosome; fractal | Keywords: Y-chromosome; Shannon di-nucleotide entropy; fractal dimension; centromeric genes; gene degredation; lncRNA . | 10,052 |
node sets. This a gives model-based clustering of the | This gives a model-based clustering of the node sets. | 10,053 |
of to number real demonstrate bipartite Application the networks algorithms discussed. a observed | Application to a number of real observed bipartite networks demonstrate the algorithms discussed. | 10,054 |
discriminativeness. maintaining inter-person while reduces It the intra-person dramatically variances, the | It dramatically reduces the intra-person variances, while maintaining the inter-person discriminativeness. | 10,055 |
As is an verification. approach face recovery used face this application, for | As an application, this face recovery approach is used for face verification. | 10,056 |
on LFW dataset. the achieves state-of-the-art Our the approach performance | Our approach achieves the state-of-the-art performance on the LFW dataset. | 10,057 |
same may of loci these tameness and colocalize the reflect loci with genetic Several variants. | Several of these loci colocalize with tameness loci and may reflect the same genetic variants. | 10,058 |
Emergency (EMS) dynamic paper, Service systems. address Medical we the In this | In this paper, we address the dynamic Emergency Medical Service (EMS) systems. | 10,059 |
and to tries presented relocate A that dynamic is locate ambulances. location the model | A dynamic location model is presented that tries to locate and relocate the ambulances. | 10,060 |
Pattern This topic challenges Recognition: main the year opportunities. interdisciplinary and is: | This year the main topic is: Pattern Recognition: interdisciplinary challenges and opportunities. | 10,061 |
the model images. for computational Inspired a by saliency theory, develop in detection we | Inspired by the theory, we develop a computational model for saliency detection in images. | 10,062 |
constitute a original First, is downsampled to to the image different pyramid. scales | First, the original image is downsampled to different scales to constitute a pyramid. | 10,063 |
An special graphs. of analysis mutant non-directed on of fixation classes probability a of the | An analysis of the fixation probability of a mutant on special classes of non-directed graphs. | 10,064 |
can fast for inference. neural circuit and perform decoding plausible dynamics efficient sampling Thus, | Thus, plausible neural circuit dynamics can perform fast sampling for efficient decoding and inference. | 10,065 |
and easily-parallelized a on Building ProPPR. for algorithm we develop weight-learning fast this, | Building on this, we develop a fast and easily-parallelized weight-learning algorithm for ProPPR. | 10,066 |
been methods popularity gaining for AD Since learning related machine first introduced, have research. increasing | Since first introduced, machine learning methods have been gaining increasing popularity for AD related research. | 10,067 |
requires domain costly This and knowledge tedious. is procedure and | This procedure requires domain knowledge and is costly and tedious. | 10,068 |
shortcomings, numbers a D theory proposed. these overcome theory To is novel called | To overcome these shortcomings, a novel theory called D numbers theory is proposed. | 10,069 |
proposed is An provided the function. demonstrate case to effectiveness illustrative the of | An illustrative case is provided to demonstrate the effectiveness of the proposed function. | 10,070 |
However, to it is difficult solve. underconstrained and severely | However, it is severely underconstrained and difficult to solve. | 10,071 |
on resolution limits practical the uncomfortable can of creates we matte. This that images | This creates uncomfortable practical limits on the resolution of images that we can matte. | 10,072 |
super-linear mitigates Current literature complexity. problem, the all they but in remain | Current literature mitigates the problem, but they all remain super-linear in complexity. | 10,073 |
properties How production understood. poorly environments varying is stiffness in control with force their | How their properties control force production in environments with varying stiffness is poorly understood. | 10,074 |
a values properties Here, we isoforms into literature myosin incorporated II model. of cross-bridge for | Here, we incorporated literature values for properties of myosin II isoforms into a cross-bridge model. | 10,075 |
actin gliding from force-velocity curves speeds were Similar previous observed. expected and experiments | Similar actin gliding speeds and force-velocity curves expected from previous experiments were observed. | 10,076 |
this action In a novel paper, propose framework. we recognition | In this paper, we propose a novel action recognition framework. | 10,077 |
robust complex The accurately. view interactions point to proposed SODA+MRF transformations is detect model and | The proposed SODA+MRF model is robust to view point transformations and detect complex interactions accurately. | 10,078 |
the (HH) classical neglects dynamics. model spiking Hodgkin--Huxley concentrations time-dependence in of The ion | The classical Hodgkin--Huxley (HH) model neglects the time-dependence of ion concentrations in spiking dynamics. | 10,079 |
can modulatory spiking by the that be regulate bifurcations. explained rate mechanisms Also | Also modulatory mechanisms that regulate the spiking rate can be explained by bifurcations. | 10,080 |
candidates A compatible by non-maximal suppression. subset then is obtained of | A compatible subset of candidates is then obtained by non-maximal suppression. | 10,081 |
biological the in an interpretation play important Mathematical models experiments. of role increasingly | Mathematical models play an increasingly important role in the interpretation of biological experiments. | 10,082 |
Commonly simple symmetries. underlying patterns from observed derive | Commonly observed patterns derive from simple underlying symmetries. | 10,083 |
potential Ontology paper for ontologies rules. (Web OWL Language) the discloses of This of generation | This paper discloses the potential of OWL (Web Ontology Language) ontologies for generation of rules. | 10,084 |
Parameter discretely for processes observed estimation problem. is Markov a challenging | Parameter estimation for discretely observed Markov processes is a challenging problem. | 10,085 |
straightforward Markov However, Gillespie using simulation the algorithm. is processes of | However, simulation of Markov processes is straightforward using the Gillespie algorithm. | 10,086 |
theory. of an the open in application issue management Conflict is evidence Shafer Dempster still | Conflict management is still an open issue in the application of Dempster Shafer evidence theory. | 10,087 |
of works been A have issue. this to presented address lot | A lot of works have been presented to address this issue. | 10,088 |
this theory (GET), paper, theory, called proposed. evidence new as is In generalized a | In this paper, a new theory, called as generalized evidence theory (GET), is proposed. | 10,089 |
the handled framework evidence The conflicting is of under GET. | The conflicting evidence is handled under the framework of GET. | 10,090 |
annotated axoplasmic region are morphological a using algorithm. growing These then reticula | These axoplasmic reticula are then annotated using a morphological region growing algorithm. | 10,091 |
This method axoplasmic annotates reticula with high precision. | This method annotates axoplasmic reticula with high precision. | 10,092 |
is a challenging task. similarity Learning fine-grained image | Learning fine-grained image similarity is a challenging task. | 10,093 |
needs between-class image capture differences. and within-class It to | It needs to capture between-class and within-class image differences. | 10,094 |
A effectively. the has been developed describe multiscale network images structure to novel | A novel multiscale network structure has been developed to describe the images effectively. | 10,095 |
well-known. sparse The of representations is and capability potential | The potential and capability of sparse representations is well-known. | 10,096 |
but correlation discriminative the ability some the of overlooks considers sparsity. Besides, work | Besides, some work considers the correlation but overlooks the discriminative ability of sparsity. | 10,097 |
introduce adjusting detail. By different parameter, levels we of the smoothness | By adjusting the smoothness parameter, we introduce different levels of detail. | 10,098 |
The of is demonstrated object detection approach effectiveness with framework. Regionlets the proposed the | The effectiveness of the proposed approach is demonstrated with the Regionlets object detection framework. | 10,099 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.