text stringlengths 27 153 | label stringlengths 27 153 | id int64 0 40k |
|---|---|---|
this Learned end LATCH. Three or Patch Codes descriptors, propose To of we the Arrangements | To this end we propose the Learned Arrangements of Three Patch Codes descriptors, or LATCH. | 12,500 |
results symmetric produce methods part on bilaterally mirror Do localization object images? | Do object part localization methods produce bilaterally symmetric results on mirror images? | 12,501 |
into look paper issue. closer we In a this this take | In this paper we take a closer look into this issue. | 12,502 |
of both theoretically upper our experimentally. show We tightness bounds and | We show tightness of our upper bounds both theoretically and experimentally. | 12,503 |
reasoning. The a did device develop brain not dedicated for | The brain did not develop a dedicated device for reasoning. | 12,504 |
problem regression is as a This representation the a of from formulated holistic image. | This is formulated as a regression problem from a holistic representation of the image. | 12,505 |
are desired. much Thus, inference methods reconstruction-free for | Thus, reconstruction-free methods for inference are much desired. | 12,506 |
are This compressive for measurements. search to us preserved properties that such leads in | This leads us to search for such properties that are preserved in compressive measurements. | 12,507 |
achieved results of Recently, approach deep various learning promising computer vision. fields in has | Recently, deep learning approach has achieved promising results in various fields of computer vision. | 12,508 |
simulated and We the experiments sensor). on results report experiments (using both physical Kinect | We report results on both simulated experiments and physical experiments (using the Kinect sensor). | 12,509 |
ground depth quantitative truth, results, a demonstrate Our against accuracy. in evaluated improvement | Our results, evaluated against ground truth, demonstrate a quantitative improvement in depth accuracy. | 12,510 |
performance. impacts on the recognition report how In we observations our data big this paper, | In this paper, we report our observations on how big data impacts the recognition performance. | 12,511 |
security in a Furthermore, performance scenario. certification report real-world the we | Furthermore, we report the performance in a real-world security certification scenario. | 12,512 |
clear between exists human There performance. gap recognition and still machine a | There still exists a clear gap between machine recognition and human performance. | 12,513 |
ahead experiments three present summarize and our recent lying challenges recognition. in We face | We summarize our experiments and present three challenges lying ahead in recent face recognition. | 12,514 |
these towards indicate solutions possible we challenges. And several | And we indicate several possible solutions towards these challenges. | 12,515 |
the Sion's characterize adopted to condition. theorem saddle is value minimax | Sion's minimax theorem is adopted to characterize the saddle value condition. | 12,516 |
the likelihood rule Least are favorable ratio decision and test robust derived. distributions, the robust | Least favorable distributions, the robust decision rule and the robust likelihood ratio test are derived. | 12,517 |
evaluate derivations. the and The exemplify theoretical simulations performed | The simulations performed evaluate and exemplify the theoretical derivations. | 12,518 |
proposed In a hybrid generative-descriptive the model. using vocabulary learning is approach, performed | In the proposed approach, vocabulary learning is performed using a hybrid generative-descriptive model. | 12,519 |
Clustering Entropy statistical a relationships parts algorithm. using are Conditional Minimum learned First, between | First, statistical relationships between parts are learned using a Minimum Conditional Entropy Clustering algorithm. | 12,520 |
representation part substructures. internal compressing Finally, the with discovered by are data compositions constructed | Finally, part compositions are constructed by compressing the internal data representation with discovered substructures. | 12,521 |
better methods. than performance retrieval CHOP shape state-of-the-art Additionally, provides retrieval shape the | Additionally, CHOP provides better shape retrieval performance than the state-of-the-art shape retrieval methods. | 12,522 |
widely and theory function. Task regarding current cited is difficulty fronto-parietal in cognitive control | Task difficulty is widely cited in current theory regarding cognitive control and fronto-parietal function. | 12,523 |
for of recognition vessels valuable in numerous transparent material is Visual applications. boundaries | Visual recognition of material boundaries in transparent vessels is valuable for numerous applications. | 12,524 |
boundary. properties image material were for Several indicators the examined as | Several image properties were examined as indicators for the material boundary. | 12,525 |
The boundary found curve algorithm. using Dijkstra's was optimal | The optimal boundary curve was found using Dijkstra's algorithm. | 12,526 |
particularly with esotropia e.g. the multisystem infantile ones syndrome), disorders, associated | infantile esotropia syndrome), particularly the ones associated with multisystem disorders, e.g. | 12,527 |
paper the to of the part The package. explains use main how | The main part of the paper explains how to use the package. | 12,528 |
in illustrate real we functionality and package's artificial both examples. the Furthermore, | Furthermore, we illustrate the package's functionality in both real and artificial examples. | 12,529 |
visual literature, very BOW has the drawbacks. Although the influential in model distinct traditional two | Although very influential in the literature, the traditional visual BOW model has two distinct drawbacks. | 12,530 |
instead We to the of robustness focus noises. the model on non-Gaussian | We instead focus on the robustness of the model to non-Gaussian noises. | 12,531 |
rows/features. Also further we the for method handling data with outlier extend the | Also we further extend the method for handling the data with outlier rows/features. | 12,532 |
the studies problem. subspace This segmentation paper | This paper studies the subspace segmentation problem. | 12,533 |
The is method clustering framework. used as spectral the | The spectral clustering method is used as the framework. | 12,534 |
LSR. can a regarded which adaptively be as and It method balances SSC | It can be regarded as a method which adaptively balances SSC and LSR. | 12,535 |
CASS. and experimental effectiveness theoretical show the Both results of | Both theoretical and experimental results show the effectiveness of CASS. | 12,536 |
similarities for seems claim reasonable not but others. adaptive some This for | This claim seems reasonable for some adaptive similarities but not for others. | 12,537 |
biology. evolutionary to evolution and modern theory Darwin's both results apply of to Our | Our results apply both to Darwin's theory of evolution and to modern evolutionary biology. | 12,538 |
consider the setting linear We regression in dimension. of high | We consider the setting of linear regression in high dimension. | 12,539 |
equations, Lotka-Volterra the matrix. necessitates of interaction nonzero the For coexistence determinant sustainable generalized | For the generalized Lotka-Volterra equations, sustainable coexistence necessitates nonzero determinant of the interaction matrix. | 12,540 |
Speech to automatically. predict words spoken Recognition searches the | Speech Recognition searches to predict the spoken words automatically. | 12,541 |
will that minimizes interesting. very building the a be Hence, the recognizer model cost of | Hence, building a model that minimizes the cost of the recognizer will be very interesting. | 12,542 |
the HMM the greatly minimize using of can cost recognizer these Consequently, systems. belief | Consequently, using the belief HMM recognizer can greatly minimize the cost of these systems. | 12,543 |
compared to recent convnets their pedestrian underperform Despite successes, diverse historically detectors. other | Despite their recent diverse successes, convnets historically underperform compared to other pedestrian detectors. | 12,544 |
(e.g. network We into explicitly problem modelling omit the deliberately the | We deliberately omit explicitly modelling the problem into the network (e.g. | 12,545 |
the present on Caltech convnet dataset. best and We KITTI detectors the | We present the best convnet detectors on the Caltech and KITTI dataset. | 12,546 |
experimentally filter and on this a framework different explore unifying observation we families. propose Based | Based on this observation we propose a unifying framework and experimentally explore different filter families. | 12,547 |
analysis. a systematic report results We enabling extensive | We report extensive results enabling a systematic analysis. | 12,548 |
solved is commonly most by heuristics. this complexity, problem Due to its | Due to its complexity, this problem is most commonly solved by heuristics. | 12,549 |
of a consists be to unpromising prevents filtering moves mechanism that evaluated. Such strategy | Such strategy consists of a filtering mechanism that prevents unpromising moves to be evaluated. | 12,550 |
the other well-known two the in proposed metaheuristics. addition, analyzed In effectiveness of strategy we | In addition, we analyzed the effectiveness of the proposed strategy in two other well-known metaheuristics. | 12,551 |
We tracking novel automatically propose to populations time-lapse cell in a images. approach | We propose a novel approach to automatically tracking cell populations in time-lapse images. | 12,552 |
such a Handwritten digit recognition is example of problem. one typical | Handwritten digit recognition is a typical example of one such problem. | 12,553 |
GA a local optimize the developed To has of regions based been selection approach here. | To optimize the selection of local regions a GA based approach has been developed here. | 12,554 |
calculated the functions Mass theorem. are by Bayes from using functions generalized plausibility | Mass functions are calculated from plausibility functions by using the generalized Bayes theorem. | 12,555 |
belief a Bayesian The compared classifier approach. the with of performances are | The performances of the belief classifier are compared with a Bayesian approach. | 12,556 |
implemented on distributions been far, So based various for distributions. continuous have generating techniques discrete | So far, various techniques have been implemented for generating discrete distributions based on continuous distributions. | 12,557 |
characteristics of have this kind been distributions The and of probability studied. properties | The characteristics and properties of this kind of probability distributions have been studied. | 12,558 |
been methods. the estimation related have trough Furthermore, computed parameters classical of | Furthermore, the estimation of related parameters have been computed trough classical methods. | 12,559 |
However, parameter the through studies issue a distributions methods. of these addressed few estimate Bayesian | However, a few studies addressed the parameter estimate issue of these distributions through Bayesian methods. | 12,560 |
The patterns vocal a are elements of in birdsong example. prime | The patterns of vocal elements in birdsong are a prime example. | 12,561 |
rules The such circuits neural understood. encoding poorly of in is | The encoding of such rules in neural circuits is poorly understood. | 12,562 |
player in key birdsong a together, these findings as determining syntax. HVC Taken implicate | Taken together, these findings implicate HVC as a key player in determining birdsong syntax. | 12,563 |
new Generalized were A Model developed. Rectangular | A new Generalized Rectangular Model were developed. | 12,564 |
of are Some the generalizations existing offered. models | Some generalizations of the existing models are offered. | 12,565 |
typical is general colocalization, more tasks. than or localization far weakly-supervised cosegmentation, This | This is far more general than typical colocalization, cosegmentation, or weakly-supervised localization tasks. | 12,566 |
The software chain the of using a modular rule derivatives. follows implementation | The software follows a modular implementation using the chain rule of derivatives. | 12,567 |
reinforce ecological migratory resilience, MPAs particularly also species. for | MPAs also reinforce ecological resilience, particularly for migratory species. | 12,568 |
even of result existing deterioration or Unsuitable condition. in planning the low effectiveness MPA might | Unsuitable MPA planning might result in low effectiveness or even deterioration of the existing condition. | 12,569 |
Today areas image of many support decision are processing. and networks used more in Bayesian | Today Bayesian networks are more used in many areas of decision support and image processing. | 12,570 |
image Network the Bayesian In our to quality. this uses approach segmented proposed modelize way, | In this way, our proposed approach uses Bayesian Network to modelize the segmented image quality. | 12,571 |
on of a is This calculated measures. that quality represent set local attributes evaluation | This quality is calculated on a set of attributes that represent local evaluation measures. | 12,572 |
by we a Bayesian In Network. the phase, model superpixels second the | In the second phase, we model the superpixels by a Bayesian Network. | 12,573 |
messages. is other negatively taken However, as of side the web inflammatory an such posting | However, an other side of the web is negatively taken such as posting inflammatory messages. | 12,574 |
warning this phenomenon. this enough to of reduce But, kind is not | But, this kind of warning is not enough to reduce this phenomenon. | 12,575 |
be is uncertain defined an more To proposal framework. realistic, within our | To be more realistic, our proposal is defined within an uncertain framework. | 12,576 |
infer technique an to edge We the region. potential of structure matching unknown the use | We use an edge matching technique to infer the potential structure of the unknown region. | 12,577 |
estimated along curves. the estimated Driven structure, by synthesis texture automatically performed the is | Driven by the estimated structure, texture synthesis is performed automatically along the estimated curves. | 12,578 |
sampling. in ranked estimation entropy the This of set is with non-parametric concerned paper | This paper is concerned with non-parametric estimation of the entropy in ranked set sampling. | 12,579 |
are properties studied. of estimator Theoretical the proposed | Theoretical properties of the proposed estimator are studied. | 12,580 |
proposed simple estimator rival sampling. estimator The with random in compared the is | The proposed estimator is compared with the rival estimator in simple random sampling. | 12,581 |
the are studies examine Monte-Carlo simulation conducted performance the estimator. to Several of | Several Monte-Carlo simulation studies are conducted to examine the performance of the estimator. | 12,582 |
disease We model developed a stage-structured (EVD). Ebola virus of | We developed a stage-structured model of Ebola virus disease (EVD). | 12,583 |
to spread, due cases, interventions, asymptomatic immunity, spatiotemporal patterns, etc. pre-existing contact | due to contact patterns, interventions, spatiotemporal spread, pre-existing immunity, asymptomatic cases, etc. | 12,584 |
independance on for made. usually asumption is each For fusion, technique data the used | For each technique used for data fusion, the asumption on independance is usually made. | 12,585 |
Markov recognition. Models Hidden (HMMs) for pattern methods are learning | Hidden Markov Models (HMMs) are learning methods for pattern recognition. | 12,586 |
a we using Model present belief In paper, second-order functions. this Markov Hidden | In this paper, we present a second-order Hidden Markov Model using belief functions. | 12,587 |
first-order in HMMs on the HMMs. works Previous been belief have focused | Previous works in belief HMMs have been focused on the first-order HMMs. | 12,588 |
We second-order the model. them extend to | We extend them to the second-order model. | 12,589 |
is semantically fundamental an task from for image. meaningful Segmentation a extracting regions | Segmentation is a fundamental task for extracting semantically meaningful regions from an image. | 12,590 |
to each goal object of location. accurately The to labels image is segmentation assign algorithms | The goal of segmentation algorithms is to accurately assign object labels to each image location. | 12,591 |
of cause assignment. ambiguities and However, shortcomings algorithms, label image in uncertainty image-noise, | However, image-noise, shortcomings of algorithms, and image ambiguities cause uncertainty in label assignment. | 12,592 |
other estimate computationally to methods label On the fail efficient hand, most uncertainty. | On the other hand, most computationally efficient methods fail to estimate label uncertainty. | 12,593 |
approach a For evaluation, dataset. quantitative we apply to the our icgbench | For a quantitative evaluation, we apply our approach to the icgbench dataset. | 12,594 |
utilize between usually tree body of Mixture representing structure model parts. for relations parts | Mixture of parts model usually utilize tree structure for representing relations between body parts. | 12,595 |
We other features. incorporate cues input from | We incorporate other cues from input features. | 12,596 |
although extracted easily be relative surveillance human For environments, example, not silhouettes can flawlessly. in | For example, in surveillance environments, human silhouettes can be extracted relative easily although not flawlessly. | 12,597 |
our under framework. other method can easily extend be The generalized features to candidate | The method can be easily extend to other candidate features under our generalized framework. | 12,598 |
The approach is of pedestrian experiments through the demonstrated on datasets. efficacy standard several | The efficacy of the approach is demonstrated through experiments on several standard pedestrian datasets. | 12,599 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.