Results 31 to 40 of about 81,087 (166)

Scaling limit for the random walk on the largest connected component of the critical random graph [PDF]

, 2012
In this article, a scaling limit for the simple random walk on the largest connected component of the Erdos-Rényi random graph G(n,p) in the critical window, p = n−1+λn−4/3, is deduced.
Croydon, David A.
core   +1 more source

Tree parsing with synchronous tree-adjoining grammars

, 2011
Restricting the input or the output of a grammar-induced translation to a given set of trees plays an important role in statistical machine translation. The problem for practical systems is to find a compact (and in particular, finite) representation of ...
Vogler, Heiko, Nederhof, Mark Jan, B¨uchse, Matthias   +2 more
core  

Fuzzy set approach for event tree analysis

, 2010
[[abstract]]The traditional event tree analysis uses a single probability to represent each top event. However, it is unrealistic to evaluate the occurrence of each event by using a crisp value without considering the inherent uncertainty and imprecision
Huang,David;Chen,Toly;Wang,Mao-Jiun J.
core   +1 more source

Constructing Minimal Spanning Tree Based on Rough Set Theory for Gene Selection

International Journal of Artificial Intelligence & Applications, 2012
Microarray gene dataset often contains high dimensionalities which cause difficulty in clustering and classification. Datasets containing huge number of genes lead to increased complexity and therefore, degradation of dataset handling performance. Often, all the measured features of these high-dimensional datasets are not relevant for understanding the
openaire   +1 more source

The State-of-the-Art of Set Visualization [PDF]

, 2016
Sets comprise a generic data model that has been used in a variety of data analysis problems. Such problems involve analysing and visualizing set relations between multiple sets defined over the same collection of elements. However, visualizing sets is a
Alsallakh, Bilal, Luana Micallef, Rodgers, Peter, Helwig Hauser, Silvia Miksch, Bilal Alsallakh, Wolfgang Aigner, Aigner, Wolfgang, Hauser, Helwig, Miksch, Silvia, Peter Rodgers, Micallef, Luana   +11 more
core   +1 more source

Collective suffix tree-based models for location prediction [PDF]

, 2013
Models developed for the prediction of location, where a specific individual will be present at a future time, are typically implemented using a one-model-per-user approach which cannot be employed for inferring collective or social behaviours involving ...
Eldaw, Muawya Habib Sarnoub, Mark Levene, Levene, Mark, Roussos, George, Muawya Habib Sarnoub Eldaw, George Roussos   +5 more
core   +1 more source

Average tree solutions for graph games

In this paper we consider cooperative graph games being TU-games in which players cooperate if they are connected in the communication graph. We focus our attention to the average tree solutions introduced by Herings, van der Laan and Talman [6] and ...
Remila, Eric, Solal, Philippe, Béal, Sylvain, Baron, Richard   +3 more
core  

Core Representations of the Standard Fixed Tree Game

This paper discusses the core of the game corresponding to the standard fixed tree problem. We introduce the concept of a weighted constrained egalitarian solution.
Sprumont, Y., Tijs, S.H., Koster, M.A.L., Molina, E.   +3 more
core  

Metaheuristic approaches for the quartet method of hierarchical clustering

, 2008
Given a set of objects and their pairwise distances, we wish to determine a visual representation of the data. We use the quartet paradigm to compute a hierarchy of clusters of the objects.
Darby-Dowman, K, Geleijnse, G, Korst, J, Consoli, S, Pauws, S   +4 more
core  

A non-metrizable collectionwise Hausdorff tree with no uncountable chains and no Aronszajn subtrees [PDF]

, 2006
summary:It is independent of the usual (ZFC) axioms of set theory whether every collectionwise Hausdorff tree is either metrizable or has an uncountable chain.
Nyikos, Peter J., Iwasa, Akira, Nyikos, Peter   +2 more
core