text stringlengths 27 153 | label stringlengths 27 153 | id int64 0 40k |
|---|---|---|
each symmetries out pick class. different in symmetry Different solutions | Different symmetries pick out different solutions in each symmetry class. | 1,900 |
in idea used but This a simple of powerful can ways. be number different | This simple but powerful idea can be used in a number of different ways. | 1,901 |
These evidence metadata how knowledge. provide of community structured for types valuable organizes a learning | These types of structured metadata provide valuable evidence for learning how a community organizes knowledge. | 1,902 |
ontologies data appears Structured in and many entities, taxonomies and semi-structured domains. describing | Structured and semi-structured data describing entities, taxonomies and ontologies appears in many domains. | 1,903 |
constraints. problem with structural optimization task an We as frame this | We frame this task as an optimization problem with structural constraints. | 1,904 |
the these We of samplers. consider also justification theoretical | We also consider the theoretical justification of these samplers. | 1,905 |
of the MI are image. ZM at good an shape representing and features | MI and ZM are good at representing the shape features of an image. | 1,906 |
restrict and their application ZM non-orthogonality poor of CBIR. in MI reconstruction However, of | However, non-orthogonality of MI and poor reconstruction of ZM restrict their application in CBIR. | 1,907 |
and needed. based an is efficient system Therefore, moment orthogonal CBIR | Therefore, an efficient and orthogonal moment based CBIR system is needed. | 1,908 |
(LM) image Moments faster, features are computationally shape can compactly. and orthogonal, Legendre represent | Legendre Moments (LM) are orthogonal, computationally faster, and can represent image shape features compactly. | 1,909 |
Further, improved classifier. is the Support Machine employing classification by efficiency (SVM) Vector | Further, the classification efficiency is improved by employing Support Vector Machine (SVM) classifier. | 1,910 |
examined there needed to intrusion various remain However, (IDS). detection towards be systems issues current | However, there remain various issues needed to be examined towards current intrusion detection systems (IDS). | 1,911 |
(a) representing structure preferences. (b) Our learning and contributions are | Our contributions are (a) learning structure and (b) representing preferences. | 1,912 |
dispelled words cases this have controversy. not and of Court mountains | Court cases and mountains of words have not dispelled this controversy. | 1,913 |
develop The to employed physiological authentication trait behavioral and biometric systems. is | The physiological and behavioral trait is employed to develop biometric authentication systems. | 1,914 |
the of based connected preprocessed iris on area patterns The components. are | The iris patterns are preprocessed based on area of the connected components. | 1,915 |
into quadtree region image is split components. The | The image region is split into quadtree components. | 1,916 |
components The from training determined the variance with are minimum samples. | The components with minimum variance are determined from the training samples. | 1,917 |
the moments on are Hu components. applied | Hu moments are applied on the components. | 1,918 |
a a signature where a expectation. case, in is is genuine The biometric, variations natural | The signature is a biometric, where variations in a genuine case, is a natural expectation. | 1,919 |
vary of the one instance another. to In signature signature, certain from genuine parts | In the genuine signature, certain parts of signature vary from one instance to another. | 1,920 |
breakthrough as System System to achieve Information combining Game is performance. and game Information organizations' | Game Information System as combining Information System and game is breakthrough to achieve organizations' performance. | 1,921 |
the problem for thus better guide into programs. heuristic a turn inference search We | We thus turn the inference problem into a heuristic search for better guide programs. | 1,922 |
global Using will access to enhance easy technology Web and use. | Using Web technology will enhance global access and easy to use. | 1,923 |
which collective they graph, a of a triples meaning. give to set constitutes A | A set of triples constitutes a graph, to which they give a collective meaning. | 1,924 |
of stark contrast nature thoroughly with This context-sensitive the human thought. is in | This is in stark contrast with the thoroughly context-sensitive nature of human thought. | 1,925 |
states that the MDPs assume maker decision knows actions. all and (DM) Traditional | Traditional MDPs assume that the decision maker (DM) knows all states and actions. | 1,926 |
not many this in may of interest. situations However, be true | However, this may not be true in many situations of interest. | 1,927 |
particular, near-optimal solution In polynomial can when time. in we be found characterize a | In particular, we characterize when a near-optimal solution can be found in polynomial time. | 1,928 |
In or periodic ruled out. heteroclinic of existence is the cases some cycles solutions | In some cases the existence of periodic solutions or heteroclinic cycles is ruled out. | 1,929 |
introns. depends that of assume the length the exonization process We on | We assume that the exonization process depends on the length of introns. | 1,930 |
Vertebrates, characterized long short unlike internal by are introns exons. and invertebrates, | Vertebrates, unlike invertebrates, are characterized by long introns and short internal exons. | 1,931 |
classifying self-organizing neural used for map The also network the is fingerprints. | The self-organizing map neural network is also used for classifying the fingerprints. | 1,932 |
period the of time to generation dominant corresponds these oscillation fish. the of The | The period of the oscillation corresponds to the dominant generation time of these fish. | 1,933 |
paper. A for this in introduced problems framework is general image solving inverse | A general framework for solving image inverse problems is introduced in this paper. | 1,934 |
based Gaussian efficient approach a algorithm. on mixture models, via MAP-EM is computationally The estimated | The approach is based on Gaussian mixture models, estimated via a computationally efficient MAP-EM algorithm. | 1,935 |
also motivated This effective suggests for interpretation dictionary algorithm. an the MAP-EM initialization | This interpretation also suggests an effective dictionary motivated initialization for the MAP-EM algorithm. | 1,936 |
notoriously difficult for dimensional high Density modeling is data. | Density modeling is notoriously difficult for high dimensional data. | 1,937 |
as in observed density the We space. can interpreted a how model be it show | We show how it can be interpreted as a density model in the observed space. | 1,938 |
our to are distributions, which We multimodal. highly posterior methodology apply mixture | We apply our methodology to mixture posterior distributions, which are highly multimodal. | 1,939 |
Gaussian approach We and univariate illustrate real-world with mixtures and bivariate datasets. our two | We illustrate our approach with univariate and bivariate Gaussian mixtures and two real-world datasets. | 1,940 |
between revealed transposed elements. other density SNP and differences Alu analysis | SNP density analysis revealed differences between Alu and other transposed elements. | 1,941 |
difficult is data structure, how handle clustering problem a to A i.e. manifold with in | A difficult problem in clustering is how to handle data with a manifold structure, i.e. | 1,942 |
algorithms. can most used with The combination new be metric clustering in | The new metric can be used in combination with most clustering algorithms. | 1,943 |
schemes several sub-graphs. connecting different the for We discuss possible | We discuss several possible schemes for connecting the different sub-graphs. | 1,944 |
clustering promising shows cases In metric PKNNG all results. the | In all cases the PKNNG metric shows promising clustering results. | 1,945 |
optimal and and solving both bilinear describe algorithms We approximate programs. for analyze | We describe and analyze both optimal and approximate algorithms for solving bilinear programs. | 1,946 |
a of convergent iteration. algorithm offers The generalization analysis approximate shows this that policy | The analysis shows that this algorithm offers a convergent generalization of approximate policy iteration. | 1,947 |
bilinear algorithms programming of under analyze the briefly behavior incomplete also We samples. | We also briefly analyze the behavior of bilinear programming algorithms under incomplete samples. | 1,948 |
The researchers several and of maintenance decades. cooperation evolution for fascinated | The evolution and maintenance of cooperation fascinated researchers for several decades. | 1,949 |
evolves how can the participation. solved puzzle voluntary punishment costly under be behaviour The | The puzzle how the costly punishment behaviour evolves can be solved under voluntary participation. | 1,950 |
the is emerge compulsory? punishers Could participation if | Could the punishers emerge if participation is compulsory? | 1,951 |
punishment a behaviour selfish the altruistic inevitably an Is or behaviour? | Is the punishment inevitably a selfish behaviour or an altruistic behaviour? | 1,952 |
still The punishment enigma. motivations behind an are | The motivations behind punishment are still an enigma. | 1,953 |
is portion other contributors cost. when paying to distributed The a second | The other portion is distributed to contributors when paying a second cost. | 1,954 |
This surviving indicates more and more. gaining rule: a contributing universal | This indicates a universal surviving rule: contributing more and gaining more. | 1,955 |
is machine-understandable. transformed words, current Web being machine-readable from In to other the | In other words, the current Web is transformed from being machine-readable to machine-understandable. | 1,956 |
expressiveness. of but with XML on syntax, terminologies these various and based languages are Most | Most of these languages are based on XML syntax, but with various terminologies and expressiveness. | 1,957 |
for language step. choosing is main Therefore, a an building Ontology the | Therefore, choosing a language for building an Ontology is the main step. | 1,958 |
of because knowledge-based This features. is different language different applications need kinds | This is because different kinds of knowledge-based applications need different language features. | 1,959 |
this will highlighted. of advantages neural image retrieval classification domain be and model The in | The advantages of this neural model in image classification and retrieval domain will be highlighted. | 1,960 |
three accomplishes goal its in steps. The approach main proposed | The proposed approach accomplishes its goal in three main steps. | 1,961 |
However, methods data a image when required applied meaningful these term. segmentation to | However, when applied to image segmentation these methods required a meaningful data term. | 1,962 |
systems information. how process on emphasis The understanding is biological | The emphasis is on understanding how biological systems process information. | 1,963 |
disease high process is complicated requires of a Human level expertise. and diagnosis | Human disease diagnosis is a complicated process and requires high level of expertise. | 1,964 |
can this diagnosis. tool also to Practitioners corroborate use web-based | Practitioners can also use this web-based tool to corroborate diagnosis. | 1,965 |
to order experimented evaluate The is various proposed performance. system it's in on scenarios | The proposed system is experimented on various scenarios in order to evaluate it's performance. | 1,966 |
system In the exhibits satisfactory all proposed cases, results. | In all the cases, proposed system exhibits satisfactory results. | 1,967 |
two efficient we technique for measurement an similarity this ontologies. In between paper, propose | In this paper, we propose an efficient technique for similarity measurement between two ontologies. | 1,968 |
pairs of omitting all any concepts proposed candidate similar The pair. similar technique without identifies | The proposed technique identifies all candidate pairs of similar concepts without omitting any similar pair. | 1,969 |
Programming. based logical are Answer Set on formalization the and process The reasoning | The logical formalization and the reasoning process are based on Answer Set Programming. | 1,970 |
has attention model been of in a Finding received graphical much fields. the structure many | Finding the structure of a graphical model has been received much attention in many fields. | 1,971 |
variables. exponentially of grows However, the to computational cost according its number | However, its computational cost grows exponentially according to the number of variables. | 1,972 |
illustrate We real-world artificial datasets. with the and algorithm | We illustrate the algorithm with artificial and real-world datasets. | 1,973 |
to obtain communities we in Finally the states. this apply analysis end the | Finally we apply this analysis to obtain the communities in the end states. | 1,974 |
been set and studied. of support Notions of soft have and inversion a core, defined | Notions of core, support and inversion of a soft set have been defined and studied. | 1,975 |
soft many and has in properties presented. Membership set of a structure probed been interesting | Membership structure of a soft set has been probed in and many interesting properties presented. | 1,976 |
of to Hough have classic performance Many techniques the proposed Transform. speedup been | Many techniques have been proposed to speedup the performance of classic Hough Transform. | 1,977 |
aims paper components. face extracting image at determining characteristics of the by its a This | This paper aims at determining the characteristics of a face image by extracting its components. | 1,978 |
only people with permitted preference Matchings these who appear are in lists. | Matchings are permitted only with people who appear in these preference lists. | 1,979 |
for general demonstrated. paper, In a architectures this have two been Perceptron (MLP) Multilayer | In this paper, two general architectures for a Multilayer Perceptron (MLP) have been demonstrated. | 1,980 |
been databases. have the The and using IRIS both OTCBVS of performances methods evaluated | The performances of both the methods have been evaluated using OTCBVS and IRIS databases. | 1,981 |
its can't main be but even. ignored advantage, the disadvantages is Its simplicity | Its simplicity is its main advantage, but the disadvantages can't be ignored even. | 1,982 |
and computation memory complexity The matter. also requirement | The memory requirement and computation complexity also matter. | 1,983 |
developed Many to limitations. these overcome are techniques | Many techniques are developed to overcome these limitations. | 1,984 |
NN techniques broadly structure less are and structure into based classified techniques. | NN techniques are broadly classified into structure less and structure based techniques. | 1,985 |
techniques. of paper, the this present we such survey In | In this paper, we present the survey of such techniques. | 1,986 |
computational limitation structure reduce memory less and method complexity. techniques the structure based overcome The | The structure less method overcome memory limitation and structure based techniques reduce the computational complexity. | 1,987 |
into projected are perceptron. classified images Finally, the using eigenspace a multi-layer | Finally, the images projected into eigenspace are classified using a multi-layer perceptron. | 1,988 |
database. experiments Spectrum and Beyond Visible Object we used Tracking have In Classification the (OTCBVS) | In the experiments we have used Object Tracking and Classification Beyond Visible Spectrum (OTCBVS) database. | 1,989 |
efficient an been automatic technique fusion has Here presented. recognition for face | Here an efficient fusion technique for automatic face recognition has been presented. | 1,990 |
or proposed in writing system no constraints style The assumes size. | The proposed system assumes no constraints in writing style or size. | 1,991 |
both of majority weighted are using Finally combined MLP's scheme. results the | Finally the results of both MLP's are combined using weighted majority scheme. | 1,992 |
machine classifier support and fed Neural are for then to in features vector These classification. | These features are then fed to Neural classifier and in support vector machine for classification. | 1,993 |
cake propose an cutting form online of We problem. the | We propose an online form of the cake cutting problem. | 1,994 |
situations where This dividing arrive resource. the and a depart process of models during players | This models situations where players arrive and depart during the process of dividing a resource. | 1,995 |
of constraint. NVALUE global study decompositions We the | We study decompositions of the global NVALUE constraint. | 1,996 |
inequalities. are readily encoded Finally, the decompositions linear as study we | Finally, the decompositions we study are readily encoded as linear inequalities. | 1,997 |
able integer programs. linear use to in therefore them are We | We are therefore able to use them in integer linear programs. | 1,998 |
driving evolutionary Gene duplications for primary major novelty. of are one forces | Gene duplications are one of major primary driving forces for evolutionary novelty. | 1,999 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.