text stringlengths 27 153 | label stringlengths 27 153 | id int64 0 40k |
|---|---|---|
the which wiring flow. propose to diagram, method network a reflects signal We visualize | We propose a method to visualize the wiring diagram, which reflects network signal flow. | 1,200 |
the interaction networks. the gap Finally, analyze chemical the junction between synapse and we | Finally, we analyze the interaction between the gap junction and the chemical synapse networks. | 1,201 |
the process The pseudorandom number illustrated in is Mathematica. generator using | The process is illustrated using the pseudorandom number generator in Mathematica. | 1,202 |
in the of structure resulted decrease mutual signal in information. Introducing correlations input-output | Introducing correlations in signal structure resulted in the decrease of input-output mutual information. | 1,203 |
statistical estimators functionals. of various of consistent We investigate existence the bounded-memory | We investigate the existence of bounded-memory consistent estimators of various statistical functionals. | 1,204 |
rather negative sense. the question This in strong a is in resolved | This question is resolved in the negative in a rather strong sense. | 1,205 |
stochastic approximations, automata We from using processes. and various propose theory bounded-memory techniques | We propose various bounded-memory approximations, using techniques from automata theory and stochastic processes. | 1,206 |
of interest for Some future work. raised are questions potential | Some questions of potential interest are raised for future work. | 1,207 |
a transcription with certain maximally within respond range. to These input motifs concentrations factors | These motifs respond maximally to input transcription factors with concentrations within a certain range. | 1,208 |
homeostatic motifs and pulse generating these From are networks derived. | From these motifs homeostatic and pulse generating networks are derived. | 1,209 |
is penalization which under give effective. variance sample conditions We | We give conditions under which sample variance penalization is effective. | 1,210 |
by risk particular, method. bound a excess incurred we the the In on present | In particular, we present a bound on the excess risk incurred by the method. | 1,211 |
some show We the which experimental results, theory. confirm | We show some experimental results, which confirm the theory. | 1,212 |
results discuss Finally, compression potential of our to the schemes. application we sample | Finally, we discuss the potential application of our results to sample compression schemes. | 1,213 |
our are construction of the data for recommendations investigations. such Some derived from sets | Some recommendations for the construction of such data sets are derived from our investigations. | 1,214 |
well-known Experiments conducted using face database. FERET are the | Experiments are conducted using the well-known FERET face database. | 1,215 |
rates different in of response evolve strategies. dispersal Dispersal the relative to success | Dispersal rates evolve in response to the relative success of different dispersal strategies. | 1,216 |
(J. a Hutson, simplified Mischaikow, et V. J. Dockery, K. al., deterministic In treatment | In a simplified deterministic treatment (J. Dockery, V. Hutson, K. Mischaikow, et al., J. | 1,217 |
activities about overview topic Web. The gives Semantic on an report the | The report gives an overview about activities on the topic Semantic Web. | 1,218 |
We of for cellular mean-field theory model the discuss a meta-learning. automata here | We discuss here the mean-field theory for a cellular automata model of meta-learning. | 1,219 |
double-layered real physical the is to The of structure. object tissue's the elastic construction closer | The construction of the double-layered elastic object is closer to the real tissue's physical structure. | 1,220 |
localizations, connecting laterally. through and clusters network run Pathways them several typically | Pathways typically run through several network clusters and localizations, connecting them laterally. | 1,221 |
systems change environment. can by their with Roughly descriptions interacting their these finite speaking, | Roughly speaking, these systems can change their finite descriptions by interacting with their environment. | 1,222 |
main results. contributions There four these produce used are to | There are four main contributions used to produce these results. | 1,223 |
crafted a expert. rule-based generative with by grammar a This human is specified | This is specified with a rule-based generative grammar crafted by a human expert. | 1,224 |
simulations. statistical settings encountered often are Such in | Such settings are often encountered in statistical simulations. | 1,225 |
solving two of present We different SAT the estimating methods cost for problems. | We present two different methods for estimating the cost of solving SAT problems. | 1,226 |
random the these methods and We two using of compare problems. effectiveness structured | We compare the effectiveness of these two methods using random and structured problems. | 1,227 |
robust is of A subspace developed method on decomposition. classification basis sparse the | A robust classification method is developed on the basis of sparse subspace decomposition. | 1,228 |
is query the classified to the Each significantly subspace contributes whose class subspace. into decomposed | Each query is classified into the class whose subspace significantly contributes to the decomposed subspace. | 1,229 |
their from respective different classes. classes be classified queries simultaneously can Multiple into | Multiple queries from different classes can be simultaneously classified into their respective classes. | 1,230 |
subspace for the is greedy of sparse algorithm classification. practical the decomposition A designed | A practical greedy algorithm of the sparse subspace decomposition is designed for the classification. | 1,231 |
The and exploiting recognition joint rate performance achieves sparsity. high method robust present | The present method achieves high recognition rate and robust performance exploiting joint sparsity. | 1,232 |
both satisfiability features, models. easy Based a on and compute we to classifier train runtime | Based on easy to compute features, we train both a satisfiability classifier and runtime models. | 1,233 |
these We to between use models strategies. choose restart | We use these models to choose between restart strategies. | 1,234 |
strategies. this technique restart with most present used comparing commonly We the results experimental | We present experimental results comparing this technique with the most commonly used restart strategies. | 1,235 |
effective in is that solver learning improving results demonstrate performance. Our machine | Our results demonstrate that machine learning is effective in improving solver performance. | 1,236 |
The face classification. based detection technique skin color fuzzy on information is and | The face detection technique is based on skin color information and fuzzy classification. | 1,237 |
components fiducial recognition. are points These are for by sets used wavelet described of which | These fiducial points are described by sets of wavelet components which are used for recognition. | 1,238 |
shows This powerful comparison coefficients Gabor that than distances. more geometric are | This comparison shows that Gabor coefficients are more powerful than geometric distances. | 1,239 |
agent of an We consider repeated sequence environment. interactions between an and a | We consider a sequence of repeated interactions between an agent and an environment. | 1,240 |
behavior. modeling network control disease for avoidance spread adaptive vaccine study We an disease on | We study vaccine control for disease spread on an adaptive network modeling disease avoidance behavior. | 1,241 |
distributed by vaccination susceptibles. adding is Poisson Control implemented of | Control is implemented by adding Poisson distributed vaccination of susceptibles. | 1,242 |
hydrocyclone application performance. describes methods of of approximate study analysis to some reasoning This | This study describes application of some approximate reasoning methods to analysis of hydrocyclone performance. | 1,243 |
can crisp non-crisp in be and iteration. granules implemented Balancing close-open of granules | Balancing of crisp granules and non-crisp granules can be implemented in close-open iteration. | 1,244 |
the of Validation data set on methods, is of the hydrocyclone proposed rendered. the | Validation of the proposed methods, on the data set of the hydrocyclone is rendered. | 1,245 |
the role of of the the stability for clustering We algorithm. the investigate k-means initialization | We investigate the role of the initialization for the stability of the k-means clustering algorithm. | 1,246 |
interested not in the clustering, costs in of the the only We solution. are actual | We are interested in the actual clustering, not only in the costs of the solution. | 1,247 |
the view study approaches from solutions, outliers. Unlike this of other it | Unlike other solutions, this study approaches it from the view of outliers. | 1,248 |
it rather robust a holistic runs making way, in expanding algorithm solution. a The | The expanding algorithm runs in a holistic way, making it a rather robust solution. | 1,249 |
and its power. real show Synthetic data experiments | Synthetic and real data experiments show its power. | 1,250 |
multi-class application problems the leads Furthermore, to for of introduction algorithm. an oscillator the | Furthermore, an application for multi-class problems leads to the introduction of the oscillator algorithm. | 1,251 |
use the implies of wide corresponding the The expanding result algorithm. potential | The corresponding result implies the potential wide use of the expanding algorithm. | 1,252 |
a SIS stochastic epidemic analyse population amongst a We finite households. partitioned into | We analyse a stochastic SIS epidemic amongst a finite population partitioned into households. | 1,253 |
be Stochastic physiologically coherence occurs conditions relevant. that under may | Stochastic coherence occurs under conditions that may be physiologically relevant. | 1,254 |
implement and non-unit unit Should linear coefficients? both one constraints with | Should one implement linear constraints both with unit and non-unit coefficients? | 1,255 |
shows views use propagator paper derive to to how This variants. perfect | This paper shows how to use views to derive perfect propagator variants. | 1,256 |
for is A derived and propagators introduced. model views | A model for views and derived propagators is introduced. | 1,257 |
developed. are as such systematically specialization, for and type deriving transformation, propagators Techniques generalization, conversion | Techniques for systematically deriving propagators such as transformation, generalization, specialization, and type conversion are developed. | 1,258 |
subdivision a data. image A lead to $p$-adic encoding shown hierarchical of to is interval | A hierarchical interval subdivision is shown to lead to a $p$-adic encoding of image data. | 1,259 |
of An the robustness. property inherent its is method | An inherent property of the method is its robustness. | 1,260 |
methods active exam geometric various radar segmentation. image for contour We | We exam various geometric active contour methods for radar image segmentation. | 1,261 |
images. meteorological in noises from Our is separating non-meteorological efficient method | Our method is efficient in separating non-meteorological noises from meteorological images. | 1,262 |
constructions. explore clustering these the We related between relationship also and | We also explore the relationship between these and related clustering constructions. | 1,263 |
in future. the posted be version will A rewritten | A rewritten version will be posted in the future. | 1,264 |
the a nearest-prototype prototype introduce classifier, We (PVM). vector new machine | We introduce a new nearest-prototype classifier, the prototype vector machine (PVM). | 1,265 |
its solution. approximating propose algorithms We two for | We propose two algorithms for approximating its solution. | 1,266 |
the of strengths This the highlights example a model. yielding low-error, interpretable PVM highly in | This example highlights the strengths of the PVM in yielding a low-error, highly interpretable model. | 1,267 |
molecular and large are machines. Proteins complex | Proteins are large and complex molecular machines. | 1,268 |
order In their them function, need e.g. of perform most to energy, | In order to perform their function, most of them need energy, e.g. | 1,269 |
sites stiffest Following single-site excitations, regions. within are systematically few targeted, specific the | Following single-site excitations, few specific sites are targeted, systematically within the stiffest regions. | 1,270 |
more it models, for complex e.g. We extend Kriging | We extend it for more complex Kriging models, e.g. | 1,271 |
a is it mind-map that emerges gets. framework, automatically the input, explorative from The dynamic | The explorative mind-map is a dynamic framework, that emerges automatically from the input, it gets. | 1,272 |
generic models classical include variation and the by model Barkley. The FitzHugh-Nagumo its | The generic models include the classical FitzHugh-Nagumo model and its variation by Barkley. | 1,273 |
are techniques. They standard singular perturbation treated with | They are treated with standard singular perturbation techniques. | 1,274 |
introduced. of granulation several axiomatic definitions been information have Recently, | Recently, several axiomatic definitions of information granulation have been introduced. | 1,275 |
Advanced by Rgraphviz package. provided the options are plotting | Advanced plotting options are provided by the Rgraphviz package. | 1,276 |
Recent dynamic single observe molecule in have phenomenon studies this "age-old" disorder directly. enzymology | Recent studies in single molecule enzymology have observe this "age-old" dynamic disorder phenomenon directly. | 1,277 |
single its technique However, limitation. the molecule has | However, the single molecule technique has its limitation. | 1,278 |
recognition. been very has date, reported for Farsi work Handwritten a Character Till little | Till date, a very little work has been reported for Handwritten Farsi Character recognition. | 1,279 |
to train The been algorithm MLP backpropagation error network. used the has | The error backpropagation algorithm has been used to train the MLP network. | 1,280 |
MLP training system rigorous this an network. using results Finally, HCR automatic | Finally, this rigorous training results an automatic HCR system using MLP network. | 1,281 |
relations objects between knowledge. Direction important spatial are extended commonsense | Direction relations between extended spatial objects are important commonsense knowledge. | 1,282 |
mean mixture to fit we Gaussian data. By "covering" a observed a model | By a "covering" we mean a Gaussian mixture model fit to observed data. | 1,283 |
immediate. Visual one preference for not is another over model | Visual preference for one model over another is not immediate. | 1,284 |
are real In world multiple simultaneously. applications, involved aspects however, often spatial | In real world applications, however, multiple spatial aspects are often involved simultaneously. | 1,285 |
investigates topological arising paper combined reasoning problems This with and information. in directional | This paper investigates problems arising in reasoning with combined topological and directional information. | 1,286 |
to structure way? them a in How logical | How to structure them in a logical way? | 1,287 |
What theory, the this is of n-opposition context? role in | What is the role of n-opposition theory, in this context? | 1,288 |
procedure problem. We to propose and efficient this simple an solve optimization | We propose an efficient and simple optimization procedure to solve this problem. | 1,289 |
data explain We graph. related how traffic then include we this to | We then explain how we include traffic related data to this graph. | 1,290 |
selective stimulus in are or turn, upstrokes. cells, Biphasic up/down to down/up | Biphasic cells, in turn, are selective to up/down or down/up stimulus upstrokes. | 1,291 |
the setting. client-consultant study notion of a in We informedness | We study the notion of informedness in a client-consultant setting. | 1,292 |
approach an on search. we heuristic preferred compute based propose forward-chaining To plans, | To compute preferred plans, we propose an approach based on forward-chaining heuristic search. | 1,293 |
of evaluation admissible function measuring preferences heuristic uses an partial satisfaction Our plans. over the | Our heuristic uses an admissible evaluation function measuring the satisfaction of preferences over partial plans. | 1,294 |
our evaluation effectiveness the demonstrates HTNPLAN of Our empirical heuristics. | Our empirical evaluation demonstrates the effectiveness of our HTNPLAN heuristics. | 1,295 |
fluctuation also studied. is property local The | The local fluctuation property is also studied. | 1,296 |
rendered and of crisp iteration. close-open granules rough is Balancing in granules sub | Balancing of crisp granules and sub rough granules is rendered in close-open iteration. | 1,297 |
field a The automobile where special attention. given fault a diagnosis crucial is is | The automobile is a crucial field where fault diagnosis is given a special attention. | 1,298 |
matching and techniques. done Fault using are similarity identification categorization | Fault categorization and identification are done using similarity matching techniques. | 1,299 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.