text stringlengths 27 153 | label stringlengths 27 153 | id int64 0 40k |
|---|---|---|
are number approximate We an visible have images. of in counted cars that these also | We have also counted an approximate number of cars that are visible in these images. | 4,000 |
to In propose problem. we this "Model this method a paper, tackle Segmentation" Assisted | In this paper, we propose a "Model Assisted Segmentation" method to tackle this problem. | 4,001 |
fully method requires user and automatic is interaction. The no | The method is fully automatic and requires no user interaction. | 4,002 |
prior any the system require training. not Also, does | Also, the system does not require any prior training. | 4,003 |
results We a photographs of our on present car. real | We present our results on photographs of a real car. | 4,004 |
is in fact. well-established cognition process Context-dependence human a | Context-dependence in human cognition process is a well-established fact. | 4,005 |
was Result used convolution of to them. classify | Result of convolution was used to classify them. | 4,006 |
the data all image-dataset. training Moreover selected within were points images from the | Moreover the training data points were selected from all the images within image-dataset. | 4,007 |
and main stages: hyper are there heuristic move Generally, two heuristic in selection framework, acceptance. | Generally, in hyper heuristic framework, there are two main stages: heuristic selection and move acceptance. | 4,008 |
paper Heuristic This stage on develop framework. Hyper emphasizes latter the (HH) to | This paper emphasizes on the latter stage to develop Hyper Heuristic (HH) framework. | 4,009 |
methods the have network to communication and the secure infrastructure developed been Internet. over Many | Many methods have been developed to secure the network infrastructure and communication over the Internet. | 4,010 |
addition Intrusion detection new a to relatively is such techniques. | Intrusion detection is a relatively new addition to such techniques. | 4,011 |
day big is is amount by One increasing Intrusion of problem day. which | One big problem is amount of Intrusion which is increasing day by day. | 4,012 |
analysing IDS, network know then to effect. need about We using information attack the | We need to know about network attack information using IDS, then analysing the effect. | 4,013 |
AI of Introduction of intrusions. the necessitates importance in normalization | Introduction of AI necessitates the importance of normalization in intrusions. | 4,014 |
similar are typically Starfish in pentameral pentagram. they typically and show shape a symmetry, to | Starfish typically show pentameral symmetry, and they are typically similar in shape to a pentagram. | 4,015 |
In five-armed starfish autotomy, which starfish for is addition, perform crucially best on important survival. | In addition, five-armed starfish perform best on autotomy, which is crucially important for starfish survival. | 4,016 |
conformation Nevertheless, flexibility and in can see arms. of the some we number | Nevertheless, we can see some flexibility in the number and conformation of arms. | 4,017 |
derive such quantum apply a to formula. We statistics | We apply quantum statistics to derive such a formula. | 4,018 |
For self only simplicity, globular monomeric covered. proteins are folding | For simplicity, only monomeric self folding globular proteins are covered. | 4,019 |
immediate point out of applications formula. the We some | We point out some immediate applications of the formula. | 4,020 |
explains We very show the phenomena observed that well. the formula | We show that the formula explains the observed phenomena very well. | 4,021 |
Intelligent Knowledge Multidimensional Agents, Discovery. Techniques, Data Mining Profile, User Visualization, KEYWORDS: | KEYWORDS: Data Mining Techniques, Intelligent Agents, User Profile, Multidimensional Visualization, Knowledge Discovery. | 4,022 |
Determining a clusters task. optimal dataset of a challenging is in number | Determining optimal number of clusters in a dataset is a challenging task. | 4,023 |
methods there some that algorithm unique solution. available, produces no Though is are clustering | Though some methods are available, there is no algorithm that produces unique clustering solution. | 4,024 |
infectivity in This individuals. is model, e.g., natural of susceptibility a heterogeneity or to framework | This is a natural framework to model, e.g., heterogeneity in susceptibility or infectivity of individuals. | 4,025 |
We theory, results necessary with review, approach. along the using the obtained discussed the | We review, along with the necessary theory, the results obtained using the discussed approach. | 4,026 |
is Spectrum cognitive a radio. sensing in problem fundamental | Spectrum sensing is a fundamental problem in cognitive radio. | 4,027 |
is analysis threshold for setting Theoretical algorithm of discussed. the | Theoretical analysis of threshold setting for the algorithm is discussed. | 4,028 |
schemes proposed combining probability recent and years. Many first-order been in logic have representation | Many representation schemes combining first-order logic and probability have been proposed in recent years. | 4,029 |
and slower. has logical Progress in probabilistic unifying inference been | Progress in unifying logical and probabilistic inference has been slower. | 4,030 |
variable lifted greatly show Experiments outperforms it is logical structure when elimination present. that | Experiments show that it greatly outperforms lifted variable elimination when logical structure is present. | 4,031 |
evaluations to our significant over speedup alternatives. Experimental algorithms the show provide | Experimental evaluations show our algorithms to provide significant speedup over the alternatives. | 4,032 |
symmetry and the from derived form major forms the other Pentameral is are it. | Pentameral symmetry is the major form and the other forms are derived from it. | 4,033 |
believed However, which bilaterians. period, were the from to Cambrian originated echinoderms, be of ancestors | However, the ancestors of echinoderms, which originated from Cambrian period, were believed to be bilaterians. | 4,034 |
bilateral are during early development. larvae Echinoderm their | Echinoderm larvae are bilateral during their early development. | 4,035 |
possess symmetrical also controls cluster, development. Starfish which Hox gene the | Starfish also possess the Hox gene cluster, which controls symmetrical development. | 4,036 |
and a bilateral process. to Overall, developmental are mechanism echinoderms have thought | Overall, echinoderms are thought to have a bilateral developmental mechanism and process. | 4,037 |
tendency. adult this to its corroborate bilateral focused starfish we In on article, behaviors | In this article, we focused on adult starfish behaviors to corroborate its bilateral tendency. | 4,038 |
when EM. EDML especially interesting behaviors, exhibits to compared | EDML exhibits interesting behaviors, especially when compared to EM. | 4,039 |
The features geometric of the proposed the character system extracts contour. | The proposed system extracts the geometric features of the character contour. | 4,040 |
that forms on basic the the This based types features line skeleton. are character | This features are based on the basic line types that forms the character skeleton. | 4,041 |
feature gives output. as system its vector The a | The system gives a feature vector as its output. | 4,042 |
algorithm performing We inference models. MAP distributed anytime present in graphical for a | We present a distributed anytime algorithm for performing MAP inference in graphical models. | 4,043 |
as the linear formulated problem The over is relaxation graph. a programming of a edges | The problem is formulated as a linear programming relaxation over the edges of a graph. | 4,044 |
allows that constraint application The program Dantzig-Wolfe structure of decomposition the principle. resulting has a | The resulting program has a constraint structure that allows application of the Dantzig-Wolfe decomposition principle. | 4,045 |
be computed manner. over a individual are and can edges distributed defined in Subprograms | Subprograms are defined over individual edges and can be computed in a distributed manner. | 4,046 |
solutions not in graphs This memory. fit does to space state accommodates whose | This accommodates solutions to graphs whose state space does not fit in memory. | 4,047 |
the A to outcome formal the final more observations. directly infer approach from is | A more formal approach is to directly infer the final outcome from the observations. | 4,048 |
in potentials. consists models and of multiplying repeatedly summing graphical out Inference | Inference in graphical models consists of repeatedly multiplying and summing out potentials. | 4,049 |
an propose We potentials: their method values. quantizing simplifying for alternate | We propose an alternate method for simplifying potentials: quantizing their values. | 4,050 |
to decision use this algebraic do (ADDs) efficiently. diagrams We | We use algebraic decision diagrams (ADDs) to do this efficiently. | 4,051 |
tagged-fish and the daylight. varying strengths We the aggregation current of characterized to response | We characterized the response of the tagged-fish aggregation to varying current strengths and daylight. | 4,052 |
decision This decision focuses possibilistic trees. making in sequential paper on | This paper focuses on sequential decision making in possibilistic decision trees. | 4,053 |
specifically to solve the optimisation framework, is this problem. SCIP used Integer programming, | Integer programming, specifically the SCIP framework, is used to solve this optimisation problem. | 4,054 |
fast particularly for this learning. is Results a exact that method BN show | Results show that this is a particularly fast method for exact BN learning. | 4,055 |
sciences. a controlling and empirical is Identifying key in problem bias | Identifying and controlling bias is a key problem in empirical sciences. | 4,056 |
making sheds under on models This result of the light uncertainty. decision | This result sheds light on the models of decision making under uncertainty. | 4,057 |
is to achieve. difficult while often Bayes-optimal behavior, well-defined, | Bayes-optimal behavior, while well-defined, is often difficult to achieve. | 4,058 |
been face Recently proposed based recognition for the classification robust representation (SRC) sparse (FR). has | Recently the sparse representation based classification (SRC) has been proposed for robust face recognition (FR). | 4,059 |
on computational constraint sparsity high. coefficients SRC's very coding the makes Meanwhile, cost the | Meanwhile, the sparsity constraint on the coding coefficients makes SRC's computational cost very high. | 4,060 |
joint the optimal policy as Finding optimization can problem. be an formulated | Finding the optimal joint policy can be formulated as an optimization problem. | 4,061 |
lack too However, optimality are and/or guarantees. formulations existing verbose | However, existing formulations are too verbose and/or lack optimality guarantees. | 4,062 |
propose compact Integer We Mixed EDI-CR a instances. Program formulation Linear of | We propose a compact Mixed Integer Linear Program formulation of EDI-CR instances. | 4,063 |
variables. and us to allows fewer use similarly treat This sequences these | This allows us to treat these sequences similarly and use fewer variables. | 4,064 |
population, studies interaction, Such etc. identification biological for social of is useful migration, | Such identification is useful for biological studies of population, social interaction, migration, etc. | 4,065 |
such preliminary that But present bounds we results possible. are show | But we present preliminary results that show such bounds are possible. | 4,066 |
in computational abstraction, reductions exponential may applicable, when Hierarchical complexity. problem offer | Hierarchical problem abstraction, when applicable, may offer exponential reductions in computational complexity. | 4,067 |
Viterbi abstraction the show In how apply paper, problem. to temporal this to we | In this paper, we show how to apply temporal abstraction to the Viterbi problem. | 4,068 |
processing topic an in image important field. the image is segmentation Color | Color image segmentation is an important topic in the image processing field. | 4,069 |
We study in negotiation the combinatorial of problem agent-based domains. | We study the problem of agent-based negotiation in combinatorial domains. | 4,070 |
in situations. agreements inefficient such Self-interested up often agents end negotiating | Self-interested agents often end up negotiating inefficient agreements in such situations. | 4,071 |
Markov decision widely stochastic used decision environments. are (MDPs) in making in problems processes modeling | Markov decision processes (MDPs) are widely used in modeling decision making problems in stochastic environments. | 4,072 |
However, in precise very specification of difficult. MDPs functions reward the often is | However, precise specification of the reward functions in MDPs is often very difficult. | 4,073 |
also present method further for of the version up. an speed We approximate | We also present an approximate version of the method for further speed up. | 4,074 |
improves orders algorithm We our experimentally magnitude. that the by performance demonstrate of | We experimentally demonstrate that our algorithm improves the performance by orders of magnitude. | 4,075 |
that tasks. these is efficient contribution we develop this inference of for The paper algorithms | The contribution of this paper is that we develop efficient inference algorithms for these tasks. | 4,076 |
methods. To such state-of-the-art employ we tasks, solve | To solve such tasks, we employ state-of-the-art methods. | 4,077 |
to smart pulse-based analysis. We pattern provide recognition stochastic-logic an design efficient blocks | We design smart pulse-based stochastic-logic blocks to provide an efficient pattern recognition analysis. | 4,078 |
specific proposed is The to rchitecture a applied navigation problem. | The proposed rchitecture is applied to a specific navigation problem. | 4,079 |
magnitude orders system resulting solutions. The than of processor-based faster is | The resulting system is orders of magnitude faster than processor-based solutions. | 4,080 |
neuron equations. by is individual FitzHugh-Nagumo modeled each On level, the | On the individual level, each neuron is modeled by FitzHugh-Nagumo equations. | 4,081 |
uptake. involved in roots, In various zinc ZIP are plant transporters | In plant roots, various ZIP transporters are involved in zinc uptake. | 4,082 |
thought involved. unknown, is to bZIP largely are but be transcription Their factors regulation | Their regulation is largely unknown, but bZIP transcription factors are thought to be involved. | 4,083 |
activator/inhibitor. up and We with activator activator three models: dimerization set only, putative | We set up three putative models: activator only, activator with dimerization and activator/inhibitor. | 4,084 |
measurements to analyzed. fitted were These and | These were fitted to measurements and analyzed. | 4,085 |
low has or in self-similarity frequencies. memory A long properties scale-invariant process | A long memory process has self-similarity or scale-invariant properties in low frequencies. | 4,086 |
many proteomic coupled techniques. separation can to MS be | MS can be coupled to many proteomic separation techniques. | 4,087 |
However, is point. a chains analytical technological variability on these critical controlling | However, controlling technological variability on these analytical chains is a critical point. | 4,088 |
hierarchical analytical of LC-MS a In model chain. the we Method : this introduce communication, | Method : In this communication, we introduce a hierarchical model of the LC-MS analytical chain. | 4,089 |
a mixture This model. hierarchical molecular defines graph | This molecular graph defines a hierarchical mixture model. | 4,090 |
step. will the an consider digestion As we example, | As an example, we will consider the digestion step. | 4,091 |
this We in was that diel demonstrated amplified FAD. temporal the leading pattern | We demonstrated that this diel temporal pattern was amplified in the leading FAD. | 4,092 |
has standard in rendering some effectiveness. However, limitations isosurface | However, standard isosurface rendering has some limitations in effectiveness. | 4,093 |
(SDC) microdata, control disclosure of of statistical purpose a.k.a. The | The purpose of statistical disclosure control (SDC) of microdata, a.k.a. | 4,094 |
This of overview provides informal an UAI article in context. | This article provides an informal overview of UAI in context. | 4,095 |
unfavorable and consists of alternation a The periodic of habitat patches. favorable | The habitat consists of a periodic alternation of favorable and unfavorable patches. | 4,096 |
the fixed rate. In dies the at latter population | In the latter the population dies at fixed rate. | 4,097 |
invasion may advection, the However, we intense when enough, process. activate show that | However, we show that advection, when intense enough, may activate the invasion process. | 4,098 |
doing in density. tractable density so the intractable In the transition of place emerges noise | In doing so the tractable noise density emerges in place of the intractable transition density. | 4,099 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.