text stringlengths 27 153 | label stringlengths 27 153 | id int64 0 40k |
|---|---|---|
a for problem. However, optimal NP-complete is finding an order BDD an | However, finding an optimal order for a BDD is an NP-complete problem. | 3,200 |
expert been developed have based knowledge heuristic methods several Therefore, variable for ordering. on | Therefore, several heuristic methods based on expert knowledge have been developed for variable ordering. | 3,201 |
For evaluated. of model, sequences are a training each training number | For each training model, a number of training sequences are evaluated. | 3,202 |
believe sub-domains caches, in (alu, models of that etc.) We | We believe that in sub-domains of models (alu, caches, etc.) | 3,203 |
will more even valuable. prove our system | our system will prove even more valuable. | 3,204 |
known and Despite importance, ultimate its the of is the limitations strengths technique. of little | Despite its importance, little is known of the ultimate strengths and limitations of the technique. | 3,205 |
In there years, been problems. in phase interest recent transitions has combinatorial much of | In recent years, there has been much interest in phase transitions of combinatorial problems. | 3,206 |
principle algorithm. class and lossless compression in large includes such is algorithms The of any | The class of such algorithms is large and in principle includes any lossless compression algorithm. | 3,207 |
is by quality prediction comparison the made to as respect log-loss. average The measured with | The comparison is made with respect to prediction quality as measured by the average log-loss. | 3,208 |
feasible HLC of large the computationally compute The to models. theorem dimensions effective makes it | The theorem makes it computationally feasible to compute the effective dimensions of large HLC models. | 3,209 |
compute theorem used be the can dimensions tree of to models. general effective also The | The theorem can also be used to compute the effective dimensions of general tree models. | 3,210 |
hotel for predicting employ all some method virtually prices. Thus, participants | Thus, virtually all participants employ some method for predicting hotel prices. | 3,211 |
the paper of investigates Bayesian complexity networks. MAP in This | This paper investigates the complexity of MAP in Bayesian networks. | 3,212 |
even MAP Pr become easy. remains MPE when show hard that and We also | We also show that MAP remains hard even when MPE and Pr become easy. | 3,213 |
framework. We generic introduce approximation MAP a | We introduce a generic MAP approximation framework. | 3,214 |
some plan. facts that every solution valid point be true Landmarks at in must are | Landmarks are facts that must be true at some point in every valid solution plan. | 3,215 |
is and completely domain- Our planner-independent. methodology | Our methodology is completely domain- and planner-independent. | 3,216 |
data-sources. integration method for of abductive independent a an coherent introduce We | We introduce an abductive method for a coherent integration of independent data-sources. | 3,217 |
iteration popular a finding POMDPs. algorithm for for optimal near policies is Value | Value iteration is a popular algorithm for finding near optimal policies for POMDPs. | 3,218 |
paper, In value this iteration belief restricted study subsets. to we | In this paper, we study value iteration restricted to belief subsets. | 3,219 |
of 'gradual' on valuation underlying principles a discuss First, arguments we general interactions. their based | First, we discuss general principles underlying a 'gradual' valuation of arguments based on their interactions. | 3,220 |
principles, an valuation argumentation Following we for these abstract define several system. models | Following these principles, we define several valuation models for an abstract argumentation system. | 3,221 |
the Then, in of acceptability of 'graduality' arguments. concept introduce we | Then, we introduce 'graduality' in the concept of acceptability of arguments. | 3,222 |
NEXP-complete. been The general to has be problem shown | The general problem has been shown to be NEXP-complete. | 3,223 |
information among also sharing which paper their studies performance. improve This decision-makers, can the | This paper also studies information sharing among the decision-makers, which can improve their performance. | 3,224 |
were conducted with key Interviews sites. in personnel affected | Interviews were conducted with key personnel in affected sites. | 3,225 |
of widely are an Metallic number more and increasing more applications. in used nanoparticles | Metallic nanoparticles are more and more widely used in an increasing number of applications. | 3,226 |
responses our the cellular This nanoparticles. requires knowledge of increase to to | This requires to increase our knowledge of the cellular responses to nanoparticles. | 3,227 |
In appear system. this macrophages context, attractive an as | In this context, macrophages appear as an attractive system. | 3,228 |
in e.g. foreign eliminating major play matter, They a role | They play a major role in eliminating foreign matter, e.g. | 3,229 |
We learning a traffic congestion estimation on based propose algorithm. unsupervised on-line system | We propose a traffic congestion estimation system based on unsupervised on-line learning algorithm. | 3,230 |
The does detection. or not extraction on system motion background rely | The system does not rely on background extraction or motion detection. | 3,231 |
using then clustered Mixture are The K-means and Gaussian into classes features extracted two Models(GMM). | The extracted features are then clustered into two classes using K-means and Gaussian Mixture Models(GMM). | 3,232 |
shape of the Knowledge the in sphere. built forms ILS to | Knowledge built in to the ILS forms the shape of sphere. | 3,233 |
recognition presents Kannada features. spatial vowels on and This numerals multi-font/multi-size paper based | This paper presents multi-font/multi-size Kannada numerals and vowels recognition based on spatial features. | 3,234 |
by model cargo motors for The transport Refs. introduced in molecular hopping | The hopping model for cargo transport by molecular motors introduced in Refs. | 3,235 |
essential execute movement long-range for to Jamming cargos this in is motors way. of | Jamming of motors is essential for cargos to execute long-range movement in this way. | 3,236 |
is methods. in LRR equivalent So factorization to essence | So in essence LRR is equivalent to factorization methods. | 3,237 |
when robust is LRR more the data is corruption RSI heavy. than in | RSI is more robust than LRR when the corruption in data is heavy. | 3,238 |
on real of testify synthetic improved robustness both and the to Experiments data RSI. | Experiments on both synthetic and real data testify to the improved robustness of RSI. | 3,239 |
correspondence as problem. study poses a the node problem This hypergraph labeling feature | This study poses the feature correspondence problem as a hypergraph node labeling problem. | 3,240 |
group of reducing the and structure It problem is complexity relations. capable of | It is capable of reducing the complexity of problem structure and group relations. | 3,241 |
It decision architecture, selection etc. the methods, the examines path, software the | It examines the software architecture, the selection methods, the decision path, etc. | 3,242 |
level. are Queries in abstract posed the of terms | Queries are posed in the terms of abstract level. | 3,243 |
the chaining. uses and one forward exploits hybrid one reasoning The only second first | The first one uses hybrid reasoning and the second one exploits only forward chaining. | 3,244 |
shows it even This some algorithms good in results, algorithm outperforms cases. and other | This algorithm shows good results, and it even outperforms other algorithms in some cases. | 3,245 |
SQL triggers Furthermore, the executable as rules SBVR-based discussed. will of be application | Furthermore, the application of SBVR-based rules as executable SQL triggers will be discussed. | 3,246 |
The highly proper performance on and the of feature selection of OCR depends set. extraction | The performance of OCR highly depends on the proper selection and extraction of feature set. | 3,247 |
images. the character handwritten printed have proposed on tested and We Hindi method Bengali and | We have tested the proposed method on printed and handwritten Bengali and Hindi character images. | 3,248 |
demonstrate Initial the results of approach. our efficacy | Initial results demonstrate the efficacy of our approach. | 3,249 |
to presented program. application iris demo segmentation is An a together with | An application to iris segmentation is presented together with a demo program. | 3,250 |
large be of Unfortunately, data. directly cannot supervised systems due lack machine-learned scale to easily | Unfortunately, large scale systems cannot be easily machine-learned due to lack of directly supervised data. | 3,251 |
acquisition, This semantic disambiguation. up knowledge work methods combining word-sense ends and parsing, for | This work ends up combining methods for knowledge acquisition, semantic parsing, and word-sense disambiguation. | 3,252 |
are may which arise. two cases There | There are two cases which may arise. | 3,253 |
so the virions with and system host becomes zero The HIV-free. up ends | The system ends up with zero virions and so the host becomes HIV-free. | 3,254 |
population unless In the this change. persists HIV case parameters | In this case the HIV population persists unless parameters change. | 3,255 |
methods. traditional as diagnosis are of intelligence techniques being extension fault the Computational investigated | Computational intelligence techniques are being investigated as extension of the traditional fault diagnosis methods. | 3,256 |
selected of Algeria. clinker, The SCIMAT is in system the workshop factory cement | The system selected is the workshop of SCIMAT clinker, cement factory in Algeria. | 3,257 |
of quantitative focuses This review currents. aspects L-type on | This review focuses on quantitative aspects of L-type currents. | 3,258 |
CDI of important dynamical aspect is of cell an electrophysiology. models often | CDI is often an important aspect of dynamical models of cell electrophysiology. | 3,259 |
inactivation and related obtained. are of activation Distributions and parameters statistics several to | Distributions and statistics of several parameters related to activation and inactivation are obtained. | 3,260 |
with approximately Neurons into divided experimental half-activation groups potentials. two are | Neurons are divided approximately into two groups with experimental half-activation potentials. | 3,261 |
present generating time generate to We an O(N) algorithm for patterns Poisson-disc taking points. $N$ | We present an algorithm for generating Poisson-disc patterns taking O(N) time to generate $N$ points. | 3,262 |
accuracy one Fingerprint technologies. most and is recognition of popular Biometric | Fingerprint recognition is one of most popular and accuracy Biometric technologies. | 3,263 |
it Nowadays, applications. in real is used many | Nowadays, it is used in many real applications. | 3,264 |
However, a recognizing is very still complex problem. in fingerprints quality images poor | However, recognizing fingerprints in poor quality images is still a very complex problem. | 3,265 |
years, accuracy of system. given algorithms, In the to models...are many recognition recent improve | In recent years, many algorithms, models...are given to improve the accuracy of recognition system. | 3,266 |
with well that It the rigidity as tension twisting. grows as is stretching found | It is found that the stretching rigidity grows with tension as well as twisting. | 3,267 |
upon earlier light biological experimental and implications The observations. results have shed important | The results have important biological implications and shed light upon earlier experimental observations. | 3,268 |
many classification. to increase There with solve problems are aiming to efficient these approaches | There are many approaches to solve these problems with aiming to increase efficient classification. | 3,269 |
to advantages reflect fulfill this of multiform of are and image approach The classified. | The advantages of this approach are to reflect fulfill and multiform of image classified. | 3,270 |
we model Networks combines a many last which for Then applied Neural step. the develop | Then we develop a model which combines many Neural Networks applied for the last step. | 3,271 |
This each of conclusion. reliability the final gives the space classification model and evaluates | This model evaluates the reliability of each space and gives the final classification conclusion. | 3,272 |
based random (CTD) Commute on metric a Distance is graphs. Time walk | Commute Time Distance (CTD) is a random walk based metric on graphs. | 3,273 |
is metric anomaly interest inspired as the use detection. CTD by for Our a of | Our interest is inspired by the use of CTD as a metric for anomaly detection. | 3,274 |
be in backgrounded to the landscapes revealed Many could events. historical different details | Many details in the revealed landscapes could be backgrounded to different historical events. | 3,275 |
of Image Techniques. Arithmetic Filtering and Pixel-Based Fusion Methods Frequency Combination | Arithmetic Combination and Frequency Filtering Methods of Pixel-Based Image Fusion Techniques. | 3,276 |
The (BT), (MLT). includes first Brovey Transform Normalized Transformation (CN) Multiplicative and type Color Method | The first type includes Brovey Transform (BT), Color Normalized Transformation (CN) and Multiplicative Method (MLT). | 3,277 |
is solvent cavity guanines palatinate A between and filled molecules. with formed | A cavity between palatinate guanines is formed and filled with solvent molecules. | 3,278 |
centered matrix. the has Previous to work original ability reconstruct the on | Previous work has centered on the ability to reconstruct the original matrix. | 3,279 |
is and the of We on specific that performance depends demonstrate approximation. task rank the | We demonstrate that performance is task specific and depends on the rank of the approximation. | 3,280 |
The one of most used is commonly for the techniques sharpening sharpening. technique IHS | The IHS sharpening technique is one of the most commonly used techniques for sharpening. | 3,281 |
This exact leads the the of transformation?. to confusion is IHS formula what | This leads to confusion what is the exact formula of the IHS transformation?. | 3,282 |
with formalism introduce it demonstrate examples. several letter, this our we and In | In this letter, we introduce our formalism and demonstrate it with several examples. | 3,283 |
of neutral known two using the By variants family NK (i.e. | By using two known neutral variants of the NK family (i.e. | 3,284 |
structural differences two the some unknown found between landscapes. studied families We of neutral | We found some unknown structural differences between the two studied families of neutral landscapes. | 3,285 |
the space. enumeration of underlying methodology requires the search exhaustive Our current | Our current methodology requires the exhaustive enumeration of the underlying search space. | 3,286 |
sampling this developed techniques before implications. be have should analysis can Therefore, practical | Therefore, sampling techniques should be developed before this analysis can have practical implications. | 3,287 |
efficient in results method. This filtering very Gaussian | This results in very efficient Gaussian filtering method. | 3,288 |
probabilistic programming I the language offer logic alternative, As an CP-logic. of | As an alternative, I offer the probabilistic logic programming language of CP-logic. | 3,289 |
estimation compressed correlation sets of images. the This of problem paper in addresses | This paper addresses the problem of correlation estimation in sets of compressed images. | 3,290 |
correlation is estimated processing the by linear in the measurements. domain The jointly compressed | The correlation is estimated in the compressed domain by jointly processing the linear measurements. | 3,291 |
related correlated can first efficiently images the a linear using that be show We operator. | We first show that the correlated images can be efficiently related using a linear operator. | 3,292 |
then the describe domain. images Using we linear this the dependencies in between relationship compressed | Using this linear relationship we then describe the dependencies between images in the compressed domain. | 3,293 |
its such In capture users. of by ontologies vocabularies formalized terms systems shared | In such systems ontologies capture formalized vocabularies of terms shared by its users. | 3,294 |
different many views domain, have the i.e. However users cases local of in | However in many cases users have different local views of the domain, i.e. | 3,295 |
the which a in given context of term used. is | of the context in which a given term is used. | 3,296 |
debugging to the faults. Recent use diagnosis identify approaches of methods causes ontology | Recent ontology debugging approaches use diagnosis methods to identify causes of the faults. | 3,297 |
errors where typical available. no user about is information | where no information about typical user errors is available. | 3,298 |
this review To ODFs. we the end, of first manifold Riemannian | To this end, we first review the Riemannian manifold of ODFs. | 3,299 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.