text stringlengths 27 153 | label stringlengths 27 153 | id int64 0 40k |
|---|---|---|
can be complexity for especially time clustering However, their tasks. large rather | However, their time complexity can be rather large especially for clustering tasks. | 15,700 |
bound scheme the original its clustering error the between Furthermore, we and randomization. | Furthermore, we bound the error between the original clustering scheme and its randomization. | 15,701 |
a propose work novel technique postprocessing In we for reduction. this compression-artifact | In this work we propose a novel postprocessing technique for compression-artifact reduction. | 15,702 |
for diverse transform method proposed on coding. rely The suitable techniques is compression that | The proposed method is suitable for diverse compression techniques that rely on transform coding. | 15,703 |
among selection. gametes imposes strong Competition for fertilization | Competition among gametes for fertilization imposes strong selection. | 15,704 |
Yet of functional existing fertilization dynamics nature can the alter ignore that models interactions. gamete | Yet existing fertilization models ignore dynamics that can alter the functional nature of gamete interactions. | 15,705 |
viable concentrations probabilities. potentially Such drastically processes allow affect egg fertilization to | Such processes potentially allow egg concentrations to drastically affect viable fertilization probabilities. | 15,706 |
(GGMs) are Gaussian Graphical structures. network popular Models tools for studying | Gaussian Graphical Models (GGMs) are popular tools for studying network structures. | 15,707 |
estimation propose robust paper, of the Graphical sparse In this for Lasso GGMs. we Trimmed | In this paper, we propose the Trimmed Graphical Lasso for robust estimation of sparse GGMs. | 15,708 |
rigorous the of estimator We our a high-dimensional provide setting. statistical in analysis | We provide a rigorous statistical analysis of our estimator in the high-dimensional setting. | 15,709 |
estimation lack approaches guarantees. sparse statistical robust for contrast, existing In GGMs | In contrast, existing approaches for robust sparse GGMs estimation lack statistical guarantees. | 15,710 |
evolve Can how these microscopic following we understand macroscopic processes? without the observables | Can we understand how the macroscopic observables evolve without following these microscopic processes? | 15,711 |
scenes. in In work, the natural problem detection we pedestrian of consider this | In this work, we consider the problem of pedestrian detection in natural scenes. | 15,712 |
exhibit with Intuitively, different instances different of may pedestrians dramatically spatial scales features. | Intuitively, instances of pedestrians with different spatial scales may exhibit dramatically different features. | 15,713 |
We divide-and-conquer this be alleviated that substantially the issue by argue philosophy. can | We argue that this issue can be substantially alleviated by the divide-and-conquer philosophy. | 15,714 |
disjoint which model scales The from ranges. pedestrians detect built-in with sub-networks multiple introduces | The model introduces multiple built-in sub-networks which detect pedestrians with scales from disjoint ranges. | 15,715 |
slight of Here treatment a present tempotron of graphical we a reformulation problem. the | Here we present a graphical treatment of a slight reformulation of the tempotron problem. | 15,716 |
gives of new algorithms. the phrasing learning into some gradient This based insights nature | This phrasing gives some new insights into the nature of gradient based learning algorithms. | 15,717 |
can, A time. circumstances approximation provide certain approach an in based sampling polynomial under | A sampling based approach can, under certain circumstances provide an approximation in polynomial time. | 15,718 |
networks problems, share hierarchical topological Other structure. related may some neural to | Other problems, related to hierarchical neural networks may share some topological structure. | 15,719 |
the is suggest case. Here, this that we not | Here, we suggest that this is not the case. | 15,720 |
probability losses. portfolio in of We large the interested particularly are | We are particularly interested in the probability of large portfolio losses. | 15,721 |
is used capabilities. D* its for widely dynamic replanning | D* is widely used for its dynamic replanning capabilities. | 15,722 |
for are and problems, A* yielding D*, suboptimal results. suited not well MOO | A* and D*, are not well suited for MOO problems, yielding suboptimal results. | 15,723 |
for presented designed is search this paper planning. MOO optimal path algorithm in The | The search algorithm presented in this paper is designed for optimal MOO path planning. | 15,724 |
thus named Pareto into incorporates optimality and is D*-PO. The D*, algorithm | The algorithm incorporates Pareto optimality into D*, and is thus named D*-PO. | 15,725 |
solution calculating at Non-dominated the paths front Pareto step. by guaranteed search are each | Non-dominated solution paths are guaranteed by calculating the Pareto front at each search step. | 15,726 |
images Matching because appearance the cross-view challenging significantly viewpoints is and different. are | Matching cross-view images is challenging because the appearance and viewpoints are significantly different. | 15,727 |
matching. used for semantically be can cross-view Consequently, labeled performing regions | Consequently, semantically labeled regions can be used for performing cross-view matching. | 15,728 |
area An images large results. and with experimental challenging promising shows evaluation query urban a | An experimental evaluation with challenging query images and a large urban area shows promising results. | 15,729 |
it attempts, is predictable. that folding Underlying is supposed process this these | Underlying these attempts, it is supposed that this folding process is predictable. | 15,730 |
protein the folding dynamic of In topological evaluated. is this paper | In this paper the topological dynamic of protein folding is evaluated. | 15,731 |
structure prediction for both Consequences outlined. biology and are then | Consequences for both structure prediction and biology are then outlined. | 15,732 |
spontaneous low analyzing However, and duration their very due challenging is MEs intensity. short to | However, analyzing spontaneous MEs is very challenging due to their short duration and low intensity. | 15,733 |
tasks: includes ME Automatic analysis ME recognition. ME and spotting two | Automatic ME analysis includes two tasks: ME spotting and ME recognition. | 15,734 |
studies spotting, videos. spontaneous on rather than ME have posed focused previous For | For ME spotting, previous studies have focused on posed rather than spontaneous videos. | 15,735 |
recognition, the low. ME of performance previous is For studies | For ME recognition, the performance of previous studies is low. | 15,736 |
free arbitrary on videos. This unseen training and is method works | This method is training free and works on arbitrary unseen videos. | 15,737 |
ring motivates to homomorphisms}. neural us This {\it define | This motivates us to define {\it neural ring homomorphisms}. | 15,738 |
to that we find behave application, respect convexity. neural As an with nicely ring homomorphisms | As an application, we find that neural ring homomorphisms behave nicely with respect to convexity. | 15,739 |
which HQM's stochastic on are observation. formalize processes based quantum time-dependent | HQM's are based on quantum stochastic processes which formalize time-dependent observation. | 15,740 |
signal frequency-domain allow are They processing. autocovariance the calculation of which essential for functions | They allow the calculation of autocovariance functions which are essential for frequency-domain signal processing. | 15,741 |
(WIVs). weeks three after random-like became PS sparse and vitro patterns Initially in robust | Initially random-like and sparse PS patterns became robust after three weeks in vitro (WIVs). | 15,742 |
number short They characterized inter-paired and high spike occurrences of were (IPSIs). intervals by a | They were characterized by a high number of occurrences and short inter-paired spike intervals (IPSIs). | 15,743 |
between within establishing PS connectivity the activity different participated in network. Moreover, developing sites functional | Moreover, PS activity participated in establishing functional connectivity between different sites within the developing network. | 15,744 |
spiking a be PS thus may considered predictor. | PS may thus be considered a spiking predictor. | 15,745 |
circular problem objects vision an Detection in applications. images of digital several is in important | Detection of circular objects in digital images is an important problem in several vision applications. | 15,746 |
algorithms the detection knowing rely signature advance. target on target Hyperspectral in desired | Hyperspectral target detection algorithms rely on knowing the desired target signature in advance. | 15,747 |
approach signatures learning target for data An is from training presented. | An approach for learning target signatures from training data is presented. | 15,748 |
real data. on shown are Results and simulated | Results are shown on simulated and real data. | 15,749 |
videos. in to In we work, detect segment and water aim this | In this work, we aim to segment and detect water in videos. | 15,750 |
The compared to texture specific less recognition. general is problem, discussed however, | The specific problem, however, is less discussed compared to general texture recognition. | 15,751 |
we motion analyze water. Here, several properties of | Here, we analyze several motion properties of water. | 15,752 |
investigate water spatial descriptors. temporal properties derive Second, we and corresponding and the local of | Second, we investigate the temporal and spatial properties of water and derive corresponding local descriptors. | 15,753 |
pipeline parts. this consists The three of of architecture | The pipeline of this architecture consists of three parts. | 15,754 |
been problem. difficult traditionally of regarded images still computational as objects has a Recognition in | Recognition of objects in still images has traditionally been regarded as a difficult computational problem. | 15,755 |
estimation but computationally intensive, task for is motion animals. important a sighted Visual | Visual motion estimation is a computationally intensive, but important task for sighted animals. | 15,756 |
visual tasks biological of attempted sensing first one the field. the was neuromorphic in Replicating | Replicating biological visual sensing was one of the first tasks attempted in the neuromorphic field. | 15,757 |
on specifically paper focus we motion of In visual estimation. task the this | In this paper we focus specifically on the task of visual motion estimation. | 15,758 |
performs the by detecting measurement-to-target measurement automatically relevance. association It | It performs measurement-to-target association by automatically detecting the measurement relevance. | 15,759 |
state-of-the-art techniques et to et due Khan A Laet comparison al. al., with | A comparison with state-of-the-art techniques due to Khan et al., Laet et al. | 15,760 |
emerging connectomics. variability of connectivity functional is field an in Investigating temporal | Investigating temporal variability of functional connectivity is an emerging field in connectomics. | 15,761 |
applying of extracted with scale-stability This varies the number k-means. clusters when | This scale-stability varies with the number of extracted clusters when applying k-means. | 15,762 |
evidence present plays first scale-invariance that in an We showing connectivity-state role important considerations. | We present first evidence showing that scale-invariance plays an important role in connectivity-state considerations. | 15,763 |
A repository provided. frequency-resolved our is of time-series data | A data repository of our frequency-resolved time-series is provided. | 15,764 |
anatomy section Serial specimen. method for Motivation: biological is microscopy reconstruction of established an detailed | Motivation: Serial section microscopy is an established method for detailed anatomy reconstruction of biological specimen. | 15,765 |
and section may that series in This be includes order. collected imaged unknown | This includes that section series may be collected and imaged in unknown order. | 15,766 |
Werman with four returned to later. decades synonymy schlegelii supraciliaris | Werman returned supraciliaris to synonymy with schlegelii four decades later. | 15,767 |
bound the previous initialize and search Most use methods to gyroscopes features. for | Most previous methods use gyroscopes to initialize and bound the search for features. | 15,768 |
the dimer the showed existing The envelope on cavity protein. of previous the structure research | The previous research showed the existing cavity on the dimer structure of the envelope protein. | 15,769 |
this the prevented. can fusion process fashion, In be | In this fashion, the fusion process can be prevented. | 15,770 |
these character toxicity analised silico. were five in pharmacological of and The ligands | The pharmacological and toxicity character of these five ligands were analised in silico. | 15,771 |
The the was that PYRRP best result ligand. showed | The result showed that PYRRP was the best ligand. | 15,772 |
complex was Stability dynamics analyzed ligand-protein simulation. by molecular of | Stability of ligand-protein complex was analyzed by molecular dynamics simulation. | 15,773 |
depth-dependent segmentation of can the scene. This a cause | This can cause a depth-dependent segmentation of the scene. | 15,774 |
benchmarks. on videos than We thirty results more present different from | We present results on more than thirty videos from different benchmarks. | 15,775 |
essential for nutrients in stark of have processes many a Deprivation can cell. consequences | Deprivation of essential nutrients can have stark consequences for many processes in a cell. | 15,776 |
with charged amino missing tRNAs the acid. | tRNAs charged with the missing amino acid. | 15,777 |
poorly known Onychophorans, worms, and animals. rare are or velvet | Onychophorans, or velvet worms, are poorly known and rare animals. | 15,778 |
with Scanning Microscopy; Specimens solorzanoi examined Electron sp. Peripatus were | Specimens were examined with Scanning Electron Microscopy; Peripatus solorzanoi sp. | 15,779 |
be investigate separation. Furthermore, incremental we can and implementations real-time achieved if background/foreground algorithms for | Furthermore, we investigate if incremental algorithms and real-time implementations can be achieved for background/foreground separation. | 15,780 |
and The the the algorithm consistency of the estimators. assures stability | The algorithm assures the stability and the the consistency of estimators. | 15,781 |
technical the Li report al. et algorithms re-evaluates Y. proposed by This | This technical report re-evaluates the algorithms proposed by Y. Li et al. | 15,782 |
Meshlab. displayed be with can easily results analyzed The and | The results can easily be displayed and analyzed with Meshlab. | 15,783 |
proposed. both of advantages the We and shortcomings found methods | We found both advantages and shortcomings of the methods proposed. | 15,784 |
wood results, histogram is an clustering image. Using SIFT the each calculated for keypoints | Using the clustering results, an SIFT keypoints histogram is calculated for each wood image. | 15,785 |
sums. as computation rule operations of update such partition the avoids the Importantly, typical infeasible | Importantly, the update rule avoids typical infeasible operations such as the computation of partition sums. | 15,786 |
proof simulations discrete and a show for in action domains. concept We environment of | We show in simulations a proof of concept for discrete action and environment domains. | 15,787 |
A rule over label. of then posterior a application Bayes' simple probability the gives | A simple application of Bayes' rule then gives a posterior probability over the label. | 15,788 |
the a We dependent background spatially prior and foreground. use for | We use a spatially dependent prior for the background and foreground. | 15,789 |
the are habitat characteristics These Peripatopsidae. family southern with associated | These habitat characteristics are associated with the southern family Peripatopsidae. | 15,790 |
investment correlated parental conditions. environmental not and are ratio young general Sex with per | Sex ratio and parental investment per young are not correlated with general environmental conditions. | 15,791 |
more Peripatus off Larger (Peripatidae: Brazil) produce and heavier spring. females acacioi | Larger Peripatus acacioi females (Peripatidae: Brazil) produce more and heavier off spring. | 15,792 |
Then large assumptions by evaluate running we experiments. these number of a | Then we evaluate these assumptions by running a large number of experiments. | 15,793 |
become have few past networks very years. over the Deep popular | Deep networks have become very popular over the past few years. | 15,794 |
network. we In space a color introduce module this learns transformations paper within that a | In this paper we introduce a module that learns color space transformations within a network. | 15,795 |
of family a image It is transformations of (e.g. part broader | It is part of a broader family of image transformations (e.g. | 15,796 |
network populations. of an used with The arbitrary point-neuron can number be scheme | The scheme can be used with an arbitrary number of point-neuron network populations. | 15,797 |
common dimensional very field data in high are methods of reduction Dimensionality the analysis. | Dimensionality reduction methods are very common in the field of high dimensional data analysis. | 15,798 |
are for expensive. Typically, dimensionality computationally algorithms reduction | Typically, algorithms for dimensionality reduction are computationally expensive. | 15,799 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.