text stringlengths 27 153 | label stringlengths 27 153 | id int64 0 40k |
|---|---|---|
we of the effectiveness demonstrate experiments, the Through the method. proposed | Through the experiments, we demonstrate the effectiveness of the proposed method. | 11,900 |
a argumentation-theoretic Trees in literal i.e. justify Attack terms, | Attack Trees justify a literal in argumentation-theoretic terms, i.e. | 11,901 |
We bipartite based on investigate solutions weighted graphs. | We investigate solutions based on weighted bipartite graphs. | 11,902 |
can show real-world method coarsely also that provide high-quality We from products our datasets. registered | We also show that our method can provide high-quality products from coarsely registered real-world datasets. | 11,903 |
implementation future is facilitate research. MATLAB provided a to Finally, | Finally, a MATLAB implementation is provided to facilitate future research. | 11,904 |
of question study performance of medium-sized for improving classes). (thousands database the We recognition | We study the question of improving recognition performance for medium-sized database (thousands of classes). | 11,905 |
an paper in On we statistically the algorithm. contrary, optimal propose this greedy alternative, | On the contrary, in this paper we propose an alternative, statistically optimal greedy algorithm. | 11,906 |
with likelihood. maximal class next model selected The the to the is from check | The next model to check is selected from the class with the maximal likelihood. | 11,907 |
novel a propose algorithm reconstruction. sparsity this paper, for In analysis-based we | In this paper, we propose a novel algorithm for analysis-based sparsity reconstruction. | 11,908 |
a are application: on imaging. conducted compressive practical sensing Experiments magnetic resonance | Experiments are conducted on a practical application: compressive sensing magnetic resonance imaging. | 11,909 |
structures changes of involved iron large binding/dissociation. crystal different hTf conformational delineate Three in | Three different crystal structures of hTf delineate large conformational changes involved in iron binding/dissociation. | 11,910 |
lobes delivery. open, pH, endosomal available irons readily At for making both | At endosomal pH, both lobes readily open, making irons available for delivery. | 11,911 |
counting inter-observer low subjective and However, agreement. is laborious, from suffer mitosis may | However, mitosis counting is laborious, subjective and may suffer from low inter-observer agreement. | 11,912 |
descriptions evaluation of and results are eleven from presented. methods Short the | Short descriptions and results from the evaluation of eleven methods are presented. | 11,913 |
such implementation model direct more for stable semantics of For allows solving. efficient problems, | For such problems, direct implementation of stable model semantics allows for more efficient solving. | 11,914 |
information too allow in be this may coarse However, precise the layer localization. to | However, the information in this layer may be too coarse to allow precise localization. | 11,915 |
contrary, may On localization semantics. earlier in will precise capture but layers not the be | On the contrary, earlier layers may be precise in localization but will not capture semantics. | 11,916 |
Here, we base scene on a understanding representation. to object propose high-resolution | Here, we propose to base scene understanding on a high-resolution object representation. | 11,917 |
the or rotation usually more Variances in problem pose, the difficult. make scale | Variances in the pose, scale or rotation usually make the problem more difficult. | 11,918 |
or avoid Importantly, like expensive information part we using box from annotations bounding end-to-end. | Importantly, we avoid using expensive annotations like bounding box or part information from end-to-end. | 11,919 |
easier constraint generalize. The supervision makes weak work our to | The weak supervision constraint makes our work easier to generalize. | 11,920 |
achieved improvements weakest supervision and significant Our the pipeline condition. under best delivered accuracy the | Our pipeline delivered significant improvements and achieved the best accuracy under the weakest supervision condition. | 11,921 |
that competitive annotations. The is performance additional rely on other methods against | The performance is competitive against other methods that rely on additional annotations. | 11,922 |
zoonotic of are emerging Ticks important vectors diseases. | Ticks are important vectors of emerging zoonotic diseases. | 11,923 |
immature avian Furthermore, taxonomic ticks ecological hosts. to evidence that we show found or specificity | Furthermore, we found evidence that immature ticks show taxonomic or ecological specificity to avian hosts. | 11,924 |
several characteristics main The neighbors. similar normal point is with that idea has | The main idea is that normal point has similar characteristics with several neighbors. | 11,925 |
. real performance this of approach illustrated is datasets The through | The performance of this approach is illustrated through real datasets . | 11,926 |
work. consider a We depth of monocular the single estimation from image this problem in | We consider the problem of depth estimation from a single monocular image in this work. | 11,927 |
of address We videos. the in action detection problem | We address the problem of action detection in videos. | 11,928 |
two and in appearance motion incorporate We ways. | We incorporate appearance and motion in two ways. | 11,929 |
using build feature to spatio-temporal Convolutional strong classifiers extract we Networks. representations Neural Second, | Second, we extract spatio-temporal feature representations to build strong classifiers using Convolutional Neural Networks. | 11,930 |
We we produce consistent link our to call which action time, tubes. detections in predictions | We link our predictions to produce detections consistent in time, which we call action tubes. | 11,931 |
other outperforms the action task our approach techniques show in of detection. We that | We show that our approach outperforms other techniques in the task of action detection. | 11,932 |
subgraphs matrix connected We combinatorics of connectivity the linear into embedding overcome (LMI). inequalities by | We overcome the combinatorics of connectivity by embedding connected subgraphs into linear matrix inequalities (LMI). | 11,933 |
for numerous in algorithms. in improving shown search advances its Recent has search usefulness metareasoning | Recent advances in metareasoning for search has shown its usefulness in improving numerous search algorithms. | 11,934 |
paper IDA* applies heuristics This several available. when rational to are admissible metareasoning | This paper applies rational metareasoning to IDA* when several admissible heuristics are available. | 11,935 |
and in Biodiversity issues central evolution. extinction are | Biodiversity and extinction are central issues in evolution. | 11,936 |
we "border BN present our algorithm," converts directed chain. Here a which a first into | Here we first present our "border algorithm," which converts a BN into a directed chain. | 11,937 |
All in this probabilistic quantities interpretations. have paper | All quantities in this paper have probabilistic interpretations. | 11,938 |
using or matches tasks. also outperforms works for CNN Our these recent approach | Our approach also outperforms or matches recent works using CNN for these tasks. | 11,939 |
code the system complete online. is Source available of | Source code of the complete system is available online. | 11,940 |
at guarantees Our decreases original iteration. energy that each the algorithm | Our algorithm guarantees that the original energy decreases at each iteration. | 11,941 |
attenuation features and ill-conditioned bias resulting to generates matrices. feature introduces the This | This attenuation introduces bias to the resulting features and generates ill-conditioned feature matrices. | 11,942 |
for by information from at lost MIFS using compensates scales. recapturing coarse differential operators information | MIFS compensates for information lost from using differential operators by recapturing information at coarse scales. | 11,943 |
allows ranges This recaptured information different actions us match to and motion. speeds at of | This recaptured information allows us to match actions at different speeds and ranges of motion. | 11,944 |
exponentially. differential-based that the MIFS We enhances features learnability of prove | We prove that MIFS enhances the learnability of differential-based features exponentially. | 11,945 |
detection event action performance show and on results challenging tasks. improved Experimental significantly recognition | Experimental results show significantly improved performance on challenging action recognition and event detection tasks. | 11,946 |
are systems and splines available surface in with designs. curves the B\'ezier various widely | B\'ezier splines are widely available in various systems with the curves and surface designs. | 11,947 |
determines points number B\'ezier of polynomial. the of control degree the The | The number of control points determines the degree of the B\'ezier polynomial. | 11,948 |
cubic B\'ezier segments. from cubic is The B\'ezier curve obtained spline | The cubic B\'ezier spline is obtained from cubic B\'ezier curve segments. | 11,949 |
To various compared. proposed demonstrate the the experimental algorithm, of are performances results | To demonstrate the various performances of the proposed algorithm, experimental results are compared. | 11,950 |
state-of-the-art mate- D-CNN recognition. improves rial in the texture, substantially and scene | D-CNN substantially improves the state-of-the-art in texture, mate- rial and scene recognition. | 11,951 |
arbitrary can seamlessly regions multi-scale describe D-CNN shapes and incorporate and information Furthermore, sizes. of | Furthermore, D-CNN can seamlessly incorporate multi-scale information and describe regions of arbitrary shapes and sizes. | 11,952 |
multi-group case. the in These faster best are rates the known significantly than results | These rates are significantly faster than the best known results in the multi-group case. | 11,953 |
with two-group the coincide minimax optimal Moreover, rates they case. the for | Moreover, they coincide with the optimal minimax rates for the two-group case. | 11,954 |
analysis. with validate numerical We results theoretical our | We validate our theoretical results with numerical analysis. | 11,955 |
of once The again in theoretical effect foundations. Baldwin is convincing need | The Baldwin effect is once again in need of convincing theoretical foundations. | 11,956 |
experiments to show carried out describe reliability the the Moreover, the method. of we | Moreover, we describe the experiments carried out to show the reliability of the method. | 11,957 |
direct proposes classification image tags, without paper This from user-supplied filtering. of learning | This paper proposes direct learning of image classification from user-supplied tags, without filtering. | 11,958 |
user is who supplied tag Each the the online. by shared image | Each tag is supplied by the user who shared the image online. | 11,959 |
Our manual the is to approach costly. conventional extremely is complementary annotation, which of approach | Our approach is complementary to the conventional approach of manual annotation, which is extremely costly. | 11,960 |
problems. based methods problems, efficiently can to For solve cuts be large-scale submodular employed | For submodular problems, cuts based methods can be employed to efficiently solve large-scale problems. | 11,961 |
nonsubmodular solve. However, more are general challenging significantly problems to | However, general nonsubmodular problems are significantly more challenging to solve. | 11,962 |
to its Spectral easy is simple is and relaxation implement, loose. bound but | Spectral relaxation is simple and easy to implement, but its bound is loose. | 11,963 |
work, In for with BQPs, formulation desirable we present a this SDP properties. two new | In this work, we present a new SDP formulation for BQPs, with two desirable properties. | 11,964 |
First, SDP conventional relaxation it a formulations. to bound similar has | First, it has a similar relaxation bound to conventional SDP formulations. | 11,965 |
and for quasi-Newton the two solvers, Newton We namely, then dual smoothing problem. propose methods, | We then propose two solvers, namely, quasi-Newton and smoothing Newton methods, for the dual problem. | 11,966 |
are than efficiently them more significantly interior-point Both of standard methods. | Both of them are significantly more efficiently than standard interior-point methods. | 11,967 |
models Single computational a tradition long neuroscience. neuron in have | Single neuron models have a long tradition in computational neuroscience. | 11,968 |
can then overfitting. data fitted be show that efficiently to without We this model | We then show that this model can be efficiently fitted to data without overfitting. | 11,969 |
as very such basic still utilize detections. However, information distance between they | However, they still utilize very basic information such as distance between detections. | 11,970 |
are propose approach novel training detectors. images a for effective to object synthesizing that We | We propose a novel approach to synthesizing images that are effective for training object detectors. | 11,971 |
multivariate model propose statistics. underlying Gaussian We generalized analyze and the distribution to the (MGGD) | We propose and analyze the multivariate generalized Gaussian distribution (MGGD) to model the underlying statistics. | 11,972 |
configuration is color measure. KLD to with Furthermore, CIELAB the associated space obtained deviation best | Furthermore, the best configuration is obtained with CIELAB color space associated to KLD deviation measure. | 11,973 |
via nanoparticles, that depends size. uptake on cellular endocytosis, show of receptor-mediated nanoparticle Experiments strongly | Experiments show that cellular uptake of nanoparticles, via receptor-mediated endocytosis, strongly depends on nanoparticle size. | 11,974 |
proposed this a is by paper cross-convolutional-layer technique This in new achieved called adopting pooling. | This is achieved by adopting a new technique proposed in this paper called cross-convolutional-layer pooling. | 11,975 |
differences or rates across loci mutation range expansions, background in selection). | range expansions, differences in mutation rates across loci or background selection). | 11,976 |
mechanics We methods. scope and its other its compare to existing discuss | We discuss its scope and compare its mechanics to other existing methods. | 11,977 |
vision, problem learning recognition. selection and essential Feature in category is computer important for an | Feature selection is an essential problem in computer vision, important for category learning and recognition. | 11,978 |
Different classification a that we with solutions. discriminant start linear sparse from encourages boosting, formulation | Different from boosting, we start with a discriminant linear classification formulation that encourages sparse solutions. | 11,979 |
equivalent we that diverse unsupervised an Then discovers of problem clustering jointly ensembles obtain features. | Then we obtain an equivalent unsupervised clustering problem that jointly discovers ensembles of diverse features. | 11,980 |
valuable They united more but are of in cluster a powerful when independently even classifiers. | They are independently valuable but even more powerful when united in a cluster of classifiers. | 11,981 |
Mixture on distribution. which The the based Laplacian Laplacian (LMM), is Model a first is | The first is a Laplacian Mixture Model (LMM), which is based on the Laplacian distribution. | 11,982 |
variations. the due face Predicting attributes is face challenging wild in complex to | Predicting face attributes in the wild is challenging due to complex face variations. | 11,983 |
learning attribute novel for deep We propose framework in a prediction the wild. | We propose a novel deep learning framework for attribute prediction in the wild. | 11,984 |
of well sparse be concepts. can Each these combination a attribute linear with explained | Each attribute can be well explained with a sparse linear combination of these concepts. | 11,985 |
mass reporting market, cameras sales in the already GoPro increase year. penetrated every substantial | GoPro cameras already penetrated the mass market, reporting substantial increase in sales every year. | 11,986 |
few captured photographer recognized of The video when from be walking. seconds a reliably can | The photographer can be reliably recognized from a few seconds of video captured when walking. | 11,987 |
may shot also YouTube) egocentric a specific videos for photographer become by possible. | YouTube) for egocentric videos shot by a specific photographer may also become possible. | 11,988 |
Solving problem cues. motion both difficult combining a such and requires appearance | Solving such a difficult problem requires combining both appearance and motion cues. | 11,989 |
inevitable due shared In to networks, input. typically correlations presynaptic finite are | In finite networks, correlations are typically inevitable due to shared presynaptic input. | 11,990 |
Syllogism is deductive type statements. quantified reasoning a of involving | Syllogism is a type of deductive reasoning involving quantified statements. | 11,991 |
to statistic data. of the Invariance that with uninformative is transformations guarantees respect constant the | Invariance guarantees that the statistic is constant with respect to uninformative transformations of the data. | 11,992 |
gap. we closing first toward Here, a this take step | Here, we take a first step toward closing this gap. | 11,993 |
not coding benefit stimuli triplet similar correlations. both occur This when elicit does | This coding benefit does not occur when both stimuli elicit similar triplet correlations. | 11,994 |
higher-order on have coding. correlations effect results that population could a indicate strong These | These results indicate that higher-order correlations could have a strong effect on population coding. | 11,995 |
task. in real-world materials a challenging images is Recognizing | Recognizing materials in real-world images is a challenging task. | 11,996 |
not this did total variation apply regularization. to analysis algorithms based Unfortunately, on | Unfortunately, this analysis did not apply to algorithms based on total variation regularization. | 11,997 |
variation reason Our on works. why the an reveals total very based analysis algorithm | Our analysis reveals the very reason why an algorithm based on total variation works. | 11,998 |
numerical utility of through demonstrate simulated approaches experiments We these data. on the | We demonstrate the utility of these approaches through numerical experiments on simulated data. | 11,999 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.