text stringlengths 27 153 | label stringlengths 27 153 | id int64 0 40k |
|---|---|---|
optimize structure programs Current implementations of the order performance. in simplify to overall the | Current implementations simplify the structure of programs in order to optimize the overall performance. | 14,600 |
particular, as aggregates. aggregates rewritten monotone In known are simpler forms into | In particular, aggregates are rewritten into simpler forms known as monotone aggregates. | 14,601 |
function is of this no kind known. However, | However, no function of this kind is known. | 14,602 |
for semantics Some aggregates. similarities surprising results mainstream differences versus model highlight stable and | Some surprising results highlight similarities and differences versus mainstream stable model semantics for aggregates. | 14,603 |
and the "in scenarios. face regions) wild" the with | with face regions) and the "in the wild" scenarios. | 14,604 |
performance hallmark cognitive is data processes major Inferring or of constructs psychometrics. from a | Inferring processes or constructs from performance data is a major hallmark of cognitive psychometrics. | 14,605 |
if bodies or restricted \Luka are conjunctions. %, \Godel even to | %, even if bodies are restricted to \Luka or \Godel conjunctions. | 14,606 |
a these implementing also paper The prototype system translations. presents and evaluates | The paper also presents and evaluates a prototype system implementing these translations. | 14,607 |
tabling. planner is Picat's use implemented of by | Picat's planner is implemented by use of tabling. | 14,608 |
domain the knowledge. is resulting shaped policy using Finally, | Finally, the resulting policy is shaped using domain knowledge. | 14,609 |
(p,q)-Bezier study Bernstein the for degree degree and of reduction nature functions. We elevation | We study the nature of degree elevation and degree reduction for (p,q)-Bezier Bernstein functions. | 14,610 |
to The similar some new have q-Bezier curves curves. properties | The new curves have some properties similar to q-Bezier curves. | 14,611 |
(p,q)-Bernstein for some discussed. are properties curves Furthermore, Bezier fundamental | Furthermore, some fundamental properties for (p,q)-Bernstein Bezier curves are discussed. | 14,612 |
real Experiments the ECMdd. are synthetic to sets data illustrate used of and performance in | Experiments in synthetic and real data sets are used to illustrate the performance of ECMdd. | 14,613 |
internal well in show data the results capture ECMdd structure. the The could uncertainty that | The results show that ECMdd could capture well the uncertainty in the internal data structure. | 14,614 |
compared robust FCMdd. Moreover, is to more initializations it the with | Moreover, it is more robust to the initializations compared with FCMdd. | 14,615 |
applying networks. variational We Bayesian inference general stochastic a highlight when to pitfall | We highlight a pitfall when applying stochastic variational inference to general Bayesian networks. | 14,616 |
the elements. properties among interactions of ecosystem characterize impact Collectively indirect these | Collectively these properties characterize the impact of indirect interactions among ecosystem elements. | 14,617 |
addition, expresses author formats, in i.e. the standard and In visual solutions his | In addition, the author expresses his solutions in standard and visual formats, i.e. | 14,618 |
probabilities terms of natural frequencies. and in | in terms of probabilities and natural frequencies. | 14,619 |
First, gender introduces classification paper challenge and the for application research. this | First, this paper introduces the challenge and application for gender classification research. | 14,620 |
described. development classification Then, and framework of the are gender | Then, the development and framework of gender classification are described. | 14,621 |
the each discuss limitation mean strength In of highlight we and time, the method. | In mean time, we highlight the strength and discuss the limitation of each method. | 14,622 |
work. discusses Finally, for the several applications also review future this promising | Finally, this review also discusses several promising applications for the future work. | 14,623 |
has research in graphics. of the It been one topics central computer | It has been one of the central research topics in computer graphics. | 14,624 |
there single and both advantages one method perfect However, each and no has is disadvantages. | However, there is no single perfect method and each one has both advantages and disadvantages. | 14,625 |
available C++ implementation to in make use various A our ready framework is applications. to | A C++ implementation is available to make our framework ready to use in various applications. | 14,626 |
using an matrix we setup. classify criteria two in $X$ any )$, random iterative | )$, we classify any random matrix $X$ using two criteria in an iterative setup. | 14,627 |
speckle the benefits reduction In particular, by of inherits method methods. the diffusion-like | In particular, the method inherits the benefits of speckle reduction by diffusion-like methods. | 14,628 |
synthetic method. Results on performance PolSAR show the the real of and data | Results on synthetic and real PolSAR data show the performance of the method. | 14,629 |
motivated the assumption this from ideas causality. in of field can how We be show | We show how this assumption can be motivated from ideas in the field of causality. | 14,630 |
for this guarantees provide method. we However, no | However, we provide no guarantees for this method. | 14,631 |
synthetic sets gene and on deletion We data results data set. a present | We present results on synthetic data sets and a gene deletion data set. | 14,632 |
introduce framework frames for shift-invariant a signals. multi-scale, designing bi-frames adaptive, We for representing and | We introduce a framework for designing multi-scale, adaptive, shift-invariant frames and bi-frames for representing signals. | 14,633 |
in It frames improves wavelet multi-scale efficiency. coding basis classical such of as terms | It improves classical multi-scale basis such as wavelet frames in terms of coding efficiency. | 14,634 |
discussed. Connections also with deep networks convolutional are | Connections with deep convolutional networks are also discussed. | 14,635 |
this for In representation. network learning face we a propose deep a convolution paper, robust | In this paper, we propose a deep convolution network for learning a robust face representation. | 14,636 |
dataset. LFW CASIA-WebFace is on trained dataset model The and on evaluated | The model is trained on CASIA-WebFace dataset and evaluated on LFW dataset. | 14,637 |
library. a In recognition presented this we have hand gesture paper | In this paper we have presented a hand gesture recognition library. | 14,638 |
Various pointing etc. detecting cluster direction, count, orientation, finger functions cluster include | Various functions include detecting cluster count, cluster orientation, finger pointing direction, etc. | 14,639 |
and activity. with human the is on model pattern automatic based distributed brain, The | The model is based on the human brain, with automatic and distributed pattern activity. | 14,640 |
suggested. carrying different for the Methods are processes out | Methods for carrying out the different processes are suggested. | 14,641 |
gaze eye theory, a can provide tracking vision-based of good the estimate of In location. | In theory, vision-based tracking of the eye can provide a good estimate of gaze location. | 14,642 |
We present a and reinforcement third one. algorithms, learning two devise | We present two reinforcement learning algorithms, and devise a third one. | 14,643 |
introduce and it variational Dirichlet apply allocation incremental inference We latent to (LDA). | We introduce incremental variational inference and apply it to latent Dirichlet allocation (LDA). | 14,644 |
sets. of LDA We benchmark performance the on data large incremental study | We study the performance of incremental LDA on large benchmark data sets. | 14,645 |
problems analysis data. data involve modern from inferences Many streaming | Many modern data analysis problems involve inferences from streaming data. | 14,646 |
parameter high in space, inefficient problems. however, the Exploring this dimensional makes approach whole | Exploring the whole parameter space, however, makes this approach inefficient in high dimensional problems. | 14,647 |
to inference First, in systems. of the we queuing an application present context | First, we present an application to inference in the context of queuing systems. | 14,648 |
tensors the factoring presence of in low-rank consider We slabs. outlying | We consider factoring low-rank tensors in the presence of outlying slabs. | 14,649 |
the sets on data Experiments proposed show other several methods. outperforms model that image state-of-the-art | Experiments on several image data sets show that the proposed model outperforms other state-of-the-art methods. | 14,650 |
in central Phylogenetic tool trees understanding evolution. a are | Phylogenetic trees are a central tool in understanding evolution. | 14,651 |
sequence through from evolutionary inferred typically relationships and They are capture data, time. | They are typically inferred from sequence data, and capture evolutionary relationships through time. | 14,652 |
able sources (e.g. to It different trees to from essential data is be compare | It is essential to be able to compare trees from different data sources (e.g. | 14,653 |
genes and organisms) different same the inference several from methods. | several genes from the same organisms) and different inference methods. | 14,654 |
a of for trees. labeled rooted, quantitative We comparison new metric robust, propose | We propose a new metric for robust, quantitative comparison of rooted, labeled trees. | 14,655 |
it summary This makes well-supported trees. select to possible | This makes it possible to select well-supported summary trees. | 14,656 |
approach Dengue phylogenies. on demonstrate fever our We | We demonstrate our approach on Dengue fever phylogenies. | 14,657 |
train these expectation to As alternative, how here using propagation. efficiently we describe classifiers an | As an alternative, we describe here how to train these classifiers efficiently using expectation propagation. | 14,658 |
proposed instances. handling The data for with allows millions of datasets method | The proposed method allows for handling datasets with millions of data instances. | 14,659 |
that the indicate the competitive is experiments approach. Several with method described variational | Several experiments indicate that the method described is competitive with the variational approach. | 14,660 |
exhaustive on with several infeasible large dataset reasons. Working is search for | Working with exhaustive search on large dataset is infeasible for several reasons. | 14,661 |
of conduct first existing terms study degradations. of unified image-level in various the methods' | conduct the first unified study of existing methods' in terms of various image-level degradations. | 14,662 |
vital "what hand, question other the the characteristics methods' performance?" On object-level existing affect really | On the other hand, the vital question "what object-level characteristics really affect existing methods' performance?" | 14,663 |
also localization various object analyse PASCAL classes. for accuracy methods' existing We latency and VOC | We also analyse existing methods' localization accuracy and latency for various PASCAL VOC object classes. | 14,664 |
paper method This describes to characters. handwritten offline recognize the | This paper describes the method to recognize offline handwritten characters. | 14,665 |
absence makes absent) task supervision and boxes challenging. bounding are The (labels the of | The absence of supervision (labels and bounding boxes are absent) makes the task challenging. | 14,666 |
analysis well. match the Numerical theoretical simulations | Numerical simulations match the theoretical analysis well. | 14,667 |
terms is poses This possible of adaptation. constraints in what on | This poses constraints on what is possible in terms of adaptation. | 14,668 |
appearance. representation of linear The is a into then incorporated metric learned | The learned metric is then incorporated into a linear representation of appearance. | 14,669 |
for presents two constraint algorithms performing satisfaction. new This work | This work presents two new algorithms for performing constraint satisfaction. | 14,670 |
operation. to anytime support is RDMaxWalkSat shown | RDMaxWalkSat is shown to support anytime operation. | 14,671 |
is structure for the understanding function. the Understanding of these activities oscillatory essential brain | Understanding the structure of these oscillatory activities is essential for understanding the brain function. | 14,672 |
oscillations results that Our chaotic are suggest by produced systems. deterministic neural | Our results suggest that neural oscillations are produced by deterministic chaotic systems. | 14,673 |
been recognition in topic research sequence Image-based long-standing a has computer vision. | Image-based sequence recognition has been a long-standing research topic in computer vision. | 14,674 |
the are over Significant baseline improvements classification implementation. shown | Significant classification improvements are shown over the baseline implementation. | 14,675 |
(CNNs) recent performance neural remarkable demonstrated history. nets in Convolutional have | Convolutional neural nets (CNNs) have demonstrated remarkable performance in recent history. | 14,676 |
tend Such to feed-forward bottom-up work unidirectional a in fashion. approaches | Such approaches tend to work in a unidirectional bottom-up feed-forward fashion. | 14,677 |
trained GPU-optimized to gradient allows This RGs with be descent. | This allows RGs to be trained with GPU-optimized gradient descent. | 14,678 |
From CNNs RGs help probabilistic theoretical models. between a establish a perspective, and connection hierarchical | From a theoretical perspective, RGs help establish a connection between CNNs and hierarchical probabilistic models. | 14,679 |
results demonstrate state-of-the-art challenging benchmarks. on We | We demonstrate state-of-the-art results on challenging benchmarks. | 14,680 |
The phenomena origins of physical these discussed. are | The physical origins of these phenomena are discussed. | 14,681 |
methods keypoint outliers, yield for Instead, with to state-of-the-art inference localization. robustness | Instead, inference methods with robustness to outliers, yield state-of-the-art for keypoint localization. | 14,682 |
much performance. have can that recent models smaller works of shown levels achieve However, similar | However, recent works have shown that much smaller models can achieve similar levels of performance. | 14,683 |
of NN the pruning address work, this a model. problem in parameters we trained In | In this work, we address the problem of pruning parameters in a trained NN model. | 14,684 |
show similar them. to We way systematic redundant, propose are how remove a neurons and | We show how similar neurons are redundant, and propose a systematic way to remove them. | 14,685 |
phase exposure contrast to TOF our camera cameras based on In profiles. modulation, enables general | In contrast to TOF cameras based on phase modulation, our camera enables general exposure profiles. | 14,686 |
approaches. flexibility in This requires added results computational novel and | This results in added flexibility and requires novel computational approaches. | 14,687 |
are present we state-of-the-art imaging. depth results These in | These results we present are state-of-the-art in depth imaging. | 14,688 |
The of flexibility generative our approach to easily us model. our allows enrich | The flexibility of our approach allows us to easily enrich our generative model. | 14,689 |
in integrated model no seamlessly new cost. is the additional The at computational system | The new model is seamlessly integrated in the system at no additional computational cost. | 14,690 |
question pulsed also optimal Our in addresses work of design exposure the TOF systems. important | Our work also addresses the important question of optimal exposure design in pulsed TOF systems. | 14,691 |
features of is detectors, design considered. combining complexities, very complexity-aware different of cascaded The | The design of complexity-aware cascaded detectors, combining features of very different complexities, is considered. | 14,692 |
in vastly use This a detector. of features complexities enables single of the different | This enables the use of features of vastly different complexities in a single detector. | 14,693 |
insurance, risk monitoring, environmental management anomaly and portfolio detection. | portfolio monitoring, insurance, environmental risk management and anomaly detection. | 14,694 |
towards up reduction technique existing This multivariate paves methods. way EVT the dimension scaling | This dimension reduction technique paves the way towards scaling up existing multivariate EVT methods. | 14,695 |
evidence results of the relevance approach. strong provide empirical of experimental Illustrative our | Illustrative experimental results provide strong empirical evidence of the relevance of our approach. | 14,696 |
multiple, labels classes. Modeling dense relations within benefits temporal across from and | Modeling multiple, dense labels benefits from temporal relations within and across classes. | 14,697 |
artificial Neural approach (DSNS). intelligence Synaptic introduce the 'Digital Substrate' new a We (AI) called, | We introduce a new artificial intelligence (AI) approach called, the 'Digital Synaptic Neural Substrate' (DSNS). | 14,698 |
objects attributes domains uses various (e.g. It from in selected | It uses selected attributes from objects in various domains (e.g. | 14,699 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.