text stringlengths 27 153 | label stringlengths 27 153 | id int64 0 40k |
|---|---|---|
will provided. these be results Simulations comparing techniques | Simulations results comparing these techniques will be provided. | 14,500 |
Approximate expensive likelihood impossible. where Bayesian approximate computations inference models computation are performs for or | Approximate Bayesian computation performs approximate inference for models where likelihood computations are expensive or impossible. | 14,501 |
enormously results and feature images. classification extraction advances for improved Recent digital CBIR in have | Recent advances in feature extraction and classification have enormously improved CBIR results for digital images. | 14,502 |
This process. reduction speeds and the of retrieval feature leads dimensionality to up | This leads to reduction of feature dimensionality and speeds up the retrieval process. | 14,503 |
be SAT Such partitionings can parallel. corresponding in instances used for solving | Such partitionings can be used for solving corresponding SAT instances in parallel. | 14,504 |
special we associate finite in each partitioning a space. With search the point | With each partitioning we associate a point in the special finite search space. | 14,505 |
The obtained time solving estimations with well the by method. proposed agrees | The solving time agrees well with estimations obtained by the proposed method. | 14,506 |
two of processes independent percentiles The to random be variables. are the assumed monitored | The percentiles of the two monitored processes are assumed to be independent random variables. | 14,507 |
Then robustness in prior information. very poor tested the we chart the spite of of | Then we tested the robustness of the chart in spite of very poor prior information. | 14,508 |
the semantic inference module efficiency segmentation. explore beyond level CRF the of image We | We explore the efficiency of the CRF inference module beyond image level semantic segmentation. | 14,509 |
tasks. classification image surprisingly worked shown was various PCANet in well | PCANet was shown worked surprisingly well in various image classification tasks. | 14,510 |
each a segmentation of to pixel an is the image. task class-label assigning Semantic in | Semantic segmentation is the task of assigning a class-label to each pixel in an image. | 14,511 |
class which these pixel-level. However, overlapping predictions regions at the creates are conflicting | However, these regions are overlapping which creates conflicting class predictions at the pixel-level. | 14,512 |
Discriminative recognition applied variable (LVM) various are to models latent tasks. frequently visual | Discriminative latent variable models (LVM) are frequently applied to various visual recognition tasks. | 14,513 |
on variation class. (positive) the of latent Conventionally, foreground variables are the de- fined | Conventionally, latent variables are de- fined on the variation of the foreground (positive) class. | 14,514 |
function the a scoring formalize generalized LVM We such (GLVM). of | We formalize the scoring function of such a generalized LVM (GLVM). | 14,515 |
a function. for based discuss we framework on the Then learning model a GLVM scoring | Then we discuss a framework for learning a model based on the GLVM scoring function. | 14,516 |
could objections; many that has bear results. This postulate counter-intuitive it have met since observed | This postulate has since met objections; many have observed that it could bear counter-intuitive results. | 14,517 |
the in provide recovery a to paradox this We work. solution | We provide a solution to the recovery paradox in this work. | 14,518 |
possess the property. enriched belief not recovery latent theory that does We show the will | We will show that the enriched latent belief theory does not possess the recovery property. | 14,519 |
however. maintained is closure the by in logical theory, consequences The | The closure by logical consequences is maintained in the theory, however. | 14,520 |
theories. to in solution a problem it belief Hence open as serves the the set | Hence it serves as a solution to the open problem in the belief set theories. | 14,521 |
not this. methods did Existing explicitly consider | Existing methods did not explicitly consider this. | 14,522 |
DA by codes search learned ANN tasks. Better be the can for | Better codes can be learned by DA for the ANN search tasks. | 14,523 |
dictionaries the substantially We experiments by show our reduce error. that quantization optimized overall | We show by experiments that our optimized dictionaries substantially reduce the overall quantization error. | 14,524 |
image Convolutional (CNNs) achieve for are powerful models results Neural impressive Networks that classification. | Convolutional Neural Networks (CNNs) are powerful models that achieve impressive results for image classification. | 14,525 |
optimal CNN than less (e.g. A that is | A CNN that is less than optimal (e.g. | 14,526 |
images. success recognition great object in networks achieved have convolutional for still Deep | Deep convolutional networks have achieved great success for object recognition in still images. | 14,527 |
result. probably there could explain reasons We are this that that argue two | We argue that there are two reasons that could probably explain this result. | 14,528 |
Two-stream deep are models ConvNets) compared with those very in shallow domain relatively (e.g. image | Two-stream ConvNets) are relatively shallow compared with those very deep models in image domain (e.g. | 14,529 |
capacity is by their GoogLeNet), their therefore constrained depth. modeling VGGNet, and | VGGNet, GoogLeNet), and therefore their modeling capacity is constrained by their depth. | 14,530 |
recognition is easy small. the quite is action of this size extension as However, not | However, this extension is not easy as the size of action recognition is quite small. | 14,531 |
drawn attention since of the recognition a has Iris century. mid-twentieth lot | Iris recognition has drawn a lot of attention since the mid-twentieth century. | 14,532 |
possess of set features. biometric a is known features, all rich Among to iris | Among all biometric features, iris is known to possess a rich set of features. | 14,533 |
features used have recognition perform to Different the past. been in iris | Different features have been used to perform iris recognition in the past. | 14,534 |
test matching new used sample. Minimum distance perform is for each to classifier template | Minimum distance classifier is used to perform template matching for each new test sample. | 14,535 |
neutral at and At low pH. folds a in $T_m$ Ub two-state manner | At $T_m$ Ub folds in a two-state manner at low and neutral pH. | 14,536 |
main incorporate correcting The variables is idea an to SR dictionary formulation. in | The main idea is to incorporate dictionary correcting variables in an SR formulation. | 14,537 |
realization per-iteration for of and DANSER. complexity practical tailor-designed A low simple is algorithm | A simple and low per-iteration complexity algorithm is tailor-designed for practical realization of DANSER. | 14,538 |
unclear however, far, simultaneously it how are both is achieved. Thus | Thus far, however, it is unclear how both are simultaneously achieved. | 14,539 |
the (e.g. fermentation products suggests This for mechanisms that recycling | This suggests that mechanisms for recycling the fermentation products (e.g. | 14,540 |
to survival use form the criterion ensemble trees. of RSF an split log-rank | RSF use the log-rank split criterion to form an ensemble of survival trees. | 14,541 |
Harrell's and C overcome node by using for discrepancy evaluation. can splitting be This both | This discrepancy can be overcome by using Harrell's C for both node splitting and evaluation. | 14,542 |
splitting in is scenarios. preferable noisy log-rank Conversely, | Conversely, log-rank splitting is preferable in noisy scenarios. | 14,543 |
Both splitting ranger. log-rank the R~package and in are implemented C-based | Both C-based and log-rank splitting are implemented in the R~package ranger. | 14,544 |
structures rewiring. The controlled variation by in is network linkage | The variation in network structures is controlled by linkage rewiring. | 14,545 |
density, feeding more that lower results loops and show link Our i.e. trophic | Our results show that more feeding loops and lower trophic link density, i.e. | 14,546 |
logic introduce We probabilistic of the a approximation programs. lazy to approach explanation-based | We introduce a lazy approach to the explanation-based approximation of probabilistic logic programs. | 14,547 |
It part for program of explanations. searching most the the significant when only uses | It uses only the most significant part of the program when searching for explanations. | 14,548 |
state-of-the-art method inference. that show approximate this We experimentally outperforms | We experimentally show that this method outperforms state-of-the-art approximate inference. | 14,549 |
fail These scenes. in deblur methods to videos dynamic blurry | These methods fail to deblur blurry videos in dynamic scenes. | 14,550 |
energy model. efficient solvers framework also optimize provide and We to a the | We also provide a framework and efficient solvers to optimize the energy model. | 14,551 |
a to This that ANN-based MVS show potential manual alternative results grading. is an | This results show that an ANN-based MVS is a potential alternative to manual grading. | 14,552 |
recognition robots monitor is Activity interact in very where scenarios useful assist humans. or with, | Activity recognition is very useful in scenarios where robots interact with, monitor or assist humans. | 14,553 |
detect and procedure different recognize activities formulate an We optimization types. of then to | We then formulate an optimization procedure to detect and recognize activities of different types. | 14,554 |
also present We algorithm model. computationally for simple a optimizing our | We also present a computationally simple algorithm for optimizing our model. | 14,555 |
large. head variation pose the is usually | the head pose variation is usually large. | 14,556 |
In paper we make to understanding. this several texture contributions | In this paper we make several contributions to texture understanding. | 14,557 |
Hence, transmission explanations reproductive are unnecessary. statistically cultural of success invoking | Hence, explanations invoking cultural transmission of reproductive success are statistically unnecessary. | 14,558 |
and SIR immunity model time consider rate. a transmission with dependent We temporary | We consider a SIR model with temporary immunity and time dependent transmission rate. | 14,559 |
infection. as which We confers vaccination the natural immunity same dependent time assume | We assume time dependent vaccination which confers the same immunity as natural infection. | 14,560 |
but be not Radon measures. these strategies In will functions general, | In general, these strategies will not be functions but Radon measures. | 14,561 |
longer than the Obviously, hybrid the current GDAs. runs | Obviously, the hybrid runs longer than the current GDAs. | 14,562 |
last for (BoF) decade. studied bag-of-features been The has model the over thoroughly classification image | The bag-of-features (BoF) model for image classification has been thoroughly studied over the last decade. | 14,563 |
problem non-convex problem parts. posed program The that includes a two as integer is | The problem is posed as a non-convex integer program problem that includes two parts. | 14,564 |
are the and matrix. Unsupervised considered for supervised ordinal structures | Unsupervised and supervised structures are considered for the ordinal matrix. | 14,565 |
Yet suffer pain limitations. current from computational models of transmission several | Yet current computational models of pain transmission suffer from several limitations. | 14,566 |
findings far. our so reports paper This | This paper reports our findings so far. | 14,567 |
addition, the intuitively, reliability as the In increases. activity sensory stimulation decreases of frequency | In addition, intuitively, the reliability of sensory activity decreases as the stimulation frequency increases. | 14,568 |
to a a is performed refined labeling Then, achieve segmentation. binary | Then, a binary labeling is performed to achieve a refined segmentation. | 14,569 |
boxes. detected prevents This increases and annotation automatically algorithms utilizing from burden, the these bounding | This increases the annotation burden, and prevents these algorithms from utilizing automatically detected bounding boxes. | 14,570 |
solved iterated an is MRF max-flow algorithm. by model then This | This MRF model is then solved by an iterated max-flow algorithm. | 14,571 |
likelihood a method. We derive sampling and the expression simple an for efficient | We derive a simple expression for the likelihood and an efficient sampling method. | 14,572 |
Humans symbolic (i.e. been using have representation | Humans have been using symbolic representation (i.e. | 14,573 |
of graffiti aesthetic/nonaesthetic forms underscore Contemporary dichotomy. the | Contemporary forms of graffiti underscore the aesthetic/nonaesthetic dichotomy. | 14,574 |
more alignments. We similarities find the to to these use accurate relationships between propose | We propose to use the similarities between these relationships to find more accurate alignments. | 14,575 |
effective identifying Furthermore, particularly concepts. complex correspondences our is between method in | Furthermore, our method is particularly effective in identifying correspondences between complex concepts. | 14,576 |
ontology method the Our previous domains. state-of-the-art F-score achieves substantially three better than matching on | Our method achieves substantially better F-score than the previous state-of-the-art on three ontology matching domains. | 14,577 |
can Identifying and properties CSI simplify exploiting inference. | Identifying and exploiting CSI properties can simplify inference. | 14,578 |
work present one case. a we such the In show | In the present work we show one such a case. | 14,579 |
makes assumption This applications. for many them inflexible | This assumption makes them inflexible for many applications. | 14,580 |
be loading will of column-wise matrices a generation correlated. two As (indirectly) consequence, the | As a consequence, the generation of two loading matrices will be column-wise (indirectly) correlated. | 14,581 |
about our the Networks intuition relationships capture world. in | Networks capture our intuition about relationships in the world. | 14,582 |
However, the useful MIP motivating approaches. this first-order in disappears process of first-order structure development | However, useful first-order structure disappears in this process motivating the development of first-order MIP approaches. | 14,583 |
we one mfoilp, approach. such present Here | Here we present mfoilp, one such approach. | 14,584 |
and its regression depend models the Linear matrix on directly design properties. | Linear regression models depend directly on the design matrix and its properties. | 14,585 |
dataset. show difficult substantive We performance a improvement thermal-visible on face | We show substantive performance improvement on a difficult thermal-visible face dataset. | 14,586 |
that (e.g. will key closed a robots in is observation many environment relatively stay Our | Our key observation is that many robots will stay in a relatively closed environment (e.g. | 14,587 |
will available be and upon Code data acceptance. | Code and data will be available upon acceptance. | 14,588 |
refer to as "knowledge this (KT). translation" task We | We refer to this task as "knowledge translation" (KT). | 14,589 |
The target conformation. the depends on affinity | The target affinity depends on the conformation. | 14,590 |
various space and the compare explore scenarios. systematically search parameter We | We systematically explore the parameter space and compare various search scenarios. | 14,591 |
a that necessary DNA MFPT. for conformation absolutely a We find coiled fast is | We find that a coiled DNA conformation is absolutely necessary for a fast MFPT. | 14,592 |
such can be many Moreover, interesting e.g. intra-class applications, used in knowledge | Moreover, such intra-class knowledge can be used in many interesting applications, e.g. | 14,593 |
image retrieval completion. object and style-based style-based | style-based image retrieval and style-based object completion. | 14,594 |
several different sensory spatial information makes navigation of channels. use The mammalian system | The mammalian spatial navigation system makes use of several different sensory information channels. | 14,595 |
is arise path analysis dynamic similar integration from noise errors in fluctuations. A performed when | A similar analysis is performed when errors in path integration arise from dynamic noise fluctuations. | 14,596 |
forces them, their Cells stiffness can environment. to but of sense applied the also | Cells can sense forces applied to them, but also the stiffness of their environment. | 14,597 |
of TGFb large of sensor. uses complex the as latent model a Our example | Our model uses the example of large latent complex of TGFb as a sensor. | 14,598 |
We dynamic behaviours investigate of comparing the steady-state model, the with them experiments. and | We investigate the dynamic and steady-state behaviours of the model, comparing them with experiments. | 14,599 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.