text stringlengths 27 153 | label stringlengths 27 153 | id int64 0 40k |
|---|---|---|
an paper rule augmented issue addresses for of decision with classifiers This data. trained | This paper addresses an issue of decision rule for classifiers trained with augmented data. | 13,800 |
focus. Discussion of data methods augmentation primary our is of not | Discussion of methods of data augmentation is not our primary focus. | 13,801 |
blur done problem. and solving any estimation This explicitly inverse subsequent without is | This is done without explicitly solving any blur estimation and subsequent inverse problem. | 13,802 |
weights can insight representations. provide structure the of model into The neural | The structure of the model weights can provide insight into neural representations. | 13,803 |
the contributing to Often, relationships input-output with sparse, are inputs neural few output. a only | Often, neural input-output relationships are sparse, with only a few inputs contributing to the output. | 13,804 |
structured account into part regularizers to for incorporated fitting such model In sparsity, are optimization. | In part to account for such sparsity, structured regularizers are incorporated into model fitting optimization. | 13,805 |
priors, by model However, interpret to difficult make structured imposing regularizers parameters. it learned can | However, by imposing priors, structured regularizers can make it difficult to interpret learned model parameters. | 13,806 |
sampling. stationary efficient Gibbs to schemes generalizations efficient of relaxation lead Hence, deterministic | Hence, efficient deterministic stationary relaxation schemes lead to efficient generalizations of Gibbs sampling. | 13,807 |
Eye are crucial understanding in scenes. movements complex | Eye movements are crucial in understanding complex scenes. | 13,808 |
learned were via rule. Hebbian generalized weights Place-to-grid a | Place-to-grid weights were learned via a generalized Hebbian rule. | 13,809 |
non-negativity constraint Without the a output to the lattice. square converged | Without the non-negativity constraint the output converged to a square lattice. | 13,810 |
about active been in for research area two has Saliency decades. computer modeling an vision | Saliency modeling has been an active research area in computer vision for about two decades. | 13,811 |
this and basic some models. compare dataset We analyze properties of some successful | We analyze some basic properties of this dataset and compare some successful models. | 13,812 |
implementation are For fixed the iteration. equation numerical integro-differential we a an solving point by | For the numerical implementation we are solving an integro-differential equation by a fixed point iteration. | 13,813 |
second performance must efficiency and The be balanced. scenario | The second scenario performance and efficiency must be balanced. | 13,814 |
transmission, processing always presents acquisition, image images is Noise and coding, during digital steps. in | Noise is always presents in digital images during image acquisition, coding, transmission, and processing steps. | 13,815 |
this of various express models. noise paper, overview In we brief a | In this paper, we express a brief overview of various noise models. | 13,816 |
noise be their analysis by of These models origin. can selected | These noise models can be selected by analysis of their origin. | 13,817 |
The fast-to-calculate method shapes. a Hausdorff fractal to complexity has estimate of dimension been fractal | The Hausdorff fractal dimension has been a fast-to-calculate method to estimate complexity of fractal shapes. | 13,818 |
propose this for descriptor recognition. a study, novel visual scene In we place | In this study, we propose a novel scene descriptor for visual place recognition. | 13,819 |
We network neural sparse for a designed three-dimensional have implemented data. processing input convolutional | We have implemented a convolutional neural network designed for processing sparse three-dimensional input data. | 13,820 |
have cuts-based success many in minimization achieved vision great computer for energy Graph algorithms applications. | Graph cuts-based algorithms have achieved great success in energy minimization for many computer vision applications. | 13,821 |
approach. solutions via energy approximated for These multi-label functions provide algorithms move-making | These algorithms provide approximated solutions for multi-label energy functions via move-making approach. | 13,822 |
approach This solution lower-energy with generate proposal fuses the to current a a solution. | This approach fuses the current solution with a proposal to generate a lower-energy solution. | 13,823 |
is proposals necessary for the move-making appropriate generating the success approach. of the Thus, | Thus, generating the appropriate proposals is necessary for the success of the move-making approach. | 13,824 |
and approach generate application-independent In "good" proposals. an to energy-based this paper, propose we | In this paper, we propose an application-independent and energy-based approach to generate "good" proposals. | 13,825 |
is effective classes Extensive of functions. across energy different experiments our generation support proposal that | Extensive experiments support that our proposal generation is effective across different classes of energy functions. | 13,826 |
real algorithm The on and others proposed both synthetic outperforms problems. | The proposed algorithm outperforms others both on real and synthetic problems. | 13,827 |
made the direction Several have approaches been detection. in face of | Several approaches have been made in the direction of face detection. | 13,828 |
a robust Haar-like is features method method. based them, Among | Among them, Haar-like features based method is a robust method. | 13,829 |
work with - of spite In limitations. features the robustness, like some Haar | In spite of the robustness, Haar - like features work with some limitations. | 13,830 |
to instance-level ordering. It aims segmentation predict and depth accurate | It aims to predict accurate instance-level segmentation and depth ordering. | 13,831 |
One-against-one method adopted classification these is using features. | One-against-one classification method is adopted using these features. | 13,832 |
show databases the system. expression on and facial the Experiments proposed effectiveness JAFFE CK+ of | Experiments on CK+ and JAFFE facial expression databases show the effectiveness of the proposed system. | 13,833 |
available. and Several estimation routines simulation for are | Several routines for simulation and estimation are available. | 13,834 |
of function. the the based empirical matching Estimation the theoretical on with is autocorrelation | Estimation is based on the matching of the empirical with the theoretical autocorrelation function. | 13,835 |
Lamellipodium Based of Filament this (FBLM). work in treatment Model numerical We the describe the | We describe in this work the numerical treatment of the Filament Based Lamellipodium Model (FBLM). | 13,836 |
two space. dimensional Lagrange-Hermite It of dimensional over composite two is defined elements comprised | It is comprised of composite Lagrange-Hermite two dimensional elements defined over two dimensional space. | 13,837 |
in-vitro also novel experiments moving numerical present We compare and of cells. simulations to | We also present novel numerical simulations and compare to in-vitro experiments of moving cells. | 13,838 |
is feature or extraction manual required. No preprocessing step | No preprocessing step or manual feature extraction is required. | 13,839 |
available developed we descriptors. hand-crafted utilize for can enhancing techniques feature Thus | Thus we can utilize available feature enhancing techniques developed for hand-crafted descriptors. | 13,840 |
improved Our results experimental performance. on significantly recognition datasets action benchmark show four | Our experimental results on four benchmark action recognition datasets show significantly improved performance. | 13,841 |
of novel framework hybrid involves facial patches. active approach features The from proposed a extracting | The proposed framework involves a novel approach of extracting hybrid features from active facial patches. | 13,842 |
time an development of on depends its structural The complexity. organism | The development time of an organism depends on its structural complexity. | 13,843 |
complexity. is structural built in of potential The functionality | The potential of functionality is built in structural complexity. | 13,844 |
An limited limited animal longevity complexity. has it has structural because | An animal has limited longevity because it has limited structural complexity. | 13,845 |
complexity structural of species. and a are survival essential longevity for Limited limited the | Limited structural complexity and limited longevity are essential for the survival of a species. | 13,846 |
a ontology knowledge sociocultural paper presents modeling (OntoSOC) approach. This | This paper presents a sociocultural knowledge ontology (OntoSOC) modeling approach. | 13,847 |
Human approach (HAT). Theory modeling Activity based is on OntoSOC Engestrom | OntoSOC modeling approach is based on Engestrom Human Activity Theory (HAT). | 13,848 |
concepts allowed relationships and between Theory fundamental to them. identify That us | That Theory allowed us to identify fundamental concepts and relationships between them. | 13,849 |
differents top-down The define been sub-concepts. used has precess to | The top-down precess has been used to define differents sub-concepts. | 13,850 |
algorithms dynamic nature. PTZ difficulty tracking from in evaluating The arises their | The difficulty in evaluating PTZ tracking algorithms arises from their dynamic nature. | 13,851 |
online. be type of tracking only can performed This | This type of tracking can only be performed online. | 13,852 |
this new PTZ In paper, a a camera. we framework propose virtual on based evaluation | In this paper, we propose a new evaluation framework based on a virtual PTZ camera. | 13,853 |
the setting synaptic the best for weight). possible | the best possible setting for the synaptic weight). | 13,854 |
sampling of all Synaptic four experimental support. makes some which predictions, have | Synaptic sampling makes four predictions, all of which have some experimental support. | 13,855 |
it the more LTP a change the is, variable protocols. synapse should First more during | First the more variable a synapse is, the more it should change during LTP protocols. | 13,856 |
should presynpatic increase Second, rate firing falls. variability as the | Second, variability should increase as the presynpatic firing rate falls. | 13,857 |
variance mean. to PSP Third, PSP should be proportional | Third, PSP variance should be proportional to PSP mean. | 13,858 |
with soma. Fourth, from variability distance increase should the cell | Fourth, variability should increase with distance from the cell soma. | 13,859 |
non-redundant between study of We graded sets if-then of attributes. rules describing dependencies properties particular | We study properties of particular non-redundant sets of if-then rules describing dependencies between graded attributes. | 13,860 |
smartphone. for tablet computer a or unlocking | for unlocking a tablet computer or smartphone. | 13,861 |
acquisition processing step segmentation, first after i.e. The is fingerprint image | The first processing step after fingerprint image acquisition is segmentation, i.e. | 13,862 |
a repair, Misrepair. abnormality defective a links This the defective also development and | This abnormality links also a defective development and a defective repair, the Misrepair. | 13,863 |
for maintaining of Mis-reconstructions, Misrepairs, the result tissues/organs. of Aging the is a structure | Aging is a result of Mis-reconstructions, the Misrepairs, for maintaining the structure of tissues/organs. | 13,864 |
essential processes construction aging-like Mis- the (Misrepair) development for are and Mis-reconstruction of feathers. the | Mis- construction and Mis-reconstruction (Misrepair) are the essential processes for the development of aging-like feathers. | 13,865 |
of may components comprehensive examine We important two aid understanding that processes. crucially neurodynamical said | We examine two important components that may crucially aid comprehensive understanding of said neurodynamical processes. | 13,866 |
mathematical mechanism we the show finding solutions. this Using that models accelerates right | Using mathematical models we show that this mechanism accelerates finding the right solutions. | 13,867 |
i.e. synaptic we The structural is that plasticity, factor incorporate second | The second factor that we incorporate is structural synaptic plasticity, i.e. | 13,868 |
optimal reach that solutions. suffice not Hebbian to show learning does We alone | We show that Hebbian learning alone does not suffice to reach optimal solutions. | 13,869 |
of networks, resulting connected fully the to In subsets topologies components. converge | In the resulting networks, topologies converge to subsets of fully connected components. | 13,870 |
costs on although reduces the Imposing synapses the of number robust. connectivity, components remains connected | Imposing costs on synapses reduces the connectivity, although the number of connected components remains robust. | 13,871 |
adaptive Markov A Monte algorithm chain Carlo is novel presented. | A novel adaptive Markov chain Monte Carlo algorithm is presented. | 13,872 |
structure a estimates the Further, correlation density partial that proposed. of algorithm an is | Further, an algorithm that estimates the partial correlation structure of a density is proposed. | 13,873 |
two with method empirical for examples. compared is adaption The regular covariance | The method is compared with regular empirical covariance adaption for two examples. | 13,874 |
happiness reinforcement What is agents? learning for | What is happiness for reinforcement learning agents? | 13,875 |
a satisfying of definition We a desiderata. seek formal list | We seek a formal definition satisfying a list of desiderata. | 13,876 |
is definition i.e. difference proposed error, the Our happiness temporal of | Our proposed definition of happiness is the temporal difference error, i.e. | 13,877 |
our of compatible humans. on This is with and desiderata research satisfies most empirical definition | This definition satisfies most of our desiderata and is compatible with empirical research on humans. | 13,878 |
discuss state implications examples. and We several | We state several implications and discuss examples. | 13,879 |
expansion, of ability increasing Intelligence an therefore, sense-making. means | Intelligence expansion, therefore, means an increasing ability of sense-making. | 13,880 |
SSs present. estimation rough where the and of locations a potential non-selective This the is | This is a rough and non-selective estimation of the locations where the potential SSs present. | 13,881 |
extraction parallel local flow pathway. selective executed in the another Secondly, along of is feature | Secondly, another flow of local feature extraction is executed in parallel along the selective pathway. | 13,882 |
of The features size model objects. is to proposed and invariant | The proposed model is invariant to size and features of objects. | 13,883 |
task unsuitability overall for analysed Colour-based models their and are is summarised. this | Colour-based models are analysed and their overall unsuitability for this task is summarised. | 13,884 |
but weights determined, analytically cannot also output be only transferrable. The network | The network output weights cannot only be analytically determined, but also transferrable. | 13,885 |
a propose referred multiple model also Extensively, views, as MvEDA. of we | Extensively, we also propose a model of multiple views, referred as MvEDA. | 13,886 |
for these research. applications of of active is Development algorithms an field | Development of algorithms for these applications is an active field of research. | 13,887 |
insufficient. availability However, database algorithms such standard of is validate to | However, availability of standard database to validate such algorithms is insufficient. | 13,888 |
paper Infra-Red creation database of discusses under illumination. Near (NIR) This the such created a | This paper discusses the creation of such a database created under Near Infra-Red (NIR) illumination. | 13,889 |
driven trains. plasticity usually is In systems, neural spike by synaptic | In neural systems, synaptic plasticity is usually driven by spike trains. | 13,890 |
the variability influences trains spike of how remains efficacy variability unclear. the However, | However, how the variability of spike trains influences the efficacy variability remains unclear. | 13,891 |
for still indicates personal authentication. fingerprints that biometric Market popular are research most the modality | Market research indicates that fingerprints are still the most popular biometric modality for personal authentication. | 13,892 |
of new (e.g. modalities Even onset the with | Even with the onset of new modalities (e.g. | 13,893 |
the digits) human hand sections, of structure. | sections, digits) of the human hand structure. | 13,894 |
not infrastructure iris) is possible or economical to limits. due | iris) is not possible due to economical or infrastructure limits. | 13,895 |
network. semantic a We segmentation deconvolution learning by propose novel algorithm a | We propose a novel semantic segmentation algorithm by learning a deconvolution network. | 13,896 |
a We complementary discovery as the processes: tracking. of combination and problem formulate two | We formulate the problem as a combination of two complementary processes: discovery and tracking. | 13,897 |
for We variety nearest baseline captioning. a image of neighbor explore approaches | We explore a variety of nearest neighbor baseline approaches for image captioning. | 13,898 |
attribute of We to propose discover meaning. shades | We propose to discover shades of attribute meaning. | 13,899 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.