نتایج جستجو برای: minimal treesstructure building

تعداد نتایج: 364160  

Journal: :transactions on combinatorics 2012
anwar saleh alwardi n. d. soner

we define minimal cn-dominating graph $mathbf {mcn}(g)$, commonality minimal cn-dominating graph $mathbf {cmcn}(g)$ and vertex minimal cn-dominating graph $mathbf {m_{v}cn}(g)$, characterizations are given for graph $g$ for which the newly defined graphs are connected. further serval new results are developed relating to these graphs.

In recent years some multi-mode pushover procedures taking into account higher mode effects, have been proposed. The responses of considered modes are combined by the quadratic combination rules, while using the elastic modal combination rules in the inelastic phases is not valid. Here, an optimum weighted mode combination method for nonlinear static analysis is presented. Genetic algorithm is ...

Journal: :Inf. Process. Lett. 2010
Kimmo Fredriksson

We address the problem of building an index for a set D of n strings, where each string location is a subset of some finite integer alphabet of size σ, so that we can answer efficiently if a given simple query string (where each string location is a single symbol) p occurs in the set. That is, we need to efficiently find a string d ∈ D such that p[i] ∈ d[i] for every i. We show how to build suc...

2011
Vijil Chenthamarakshan Prem Melville Vikas Sindhwani Richard D. Lawrence

The rapid construction of supervised text classification models is becoming a pervasive need across many modern applications. To reduce human-labeling bottlenecks, many new statistical paradigms (e.g., active, semi-supervised, transfer and multi-task learning) have been vigorously pursued in recent literature with varying degrees of empirical success. Concurrently, the emergence of Web 2.0 plat...

2016
Ann A. Copestake Guy Emerson Michael Wayne Goodman Matic Horvat Alexander Kuhnle Ewa Muszynska

We describe resources aimed at increasing the usability of the semantic representations utilized within the DELPH-IN (Deep Linguistic Processing with HPSG) consortium. We concentrate in particular on the Dependency Minimal Recursion Semantics (DMRS) formalism, a graph-based representation designed for compositional semantic representation with deep grammars. Our main focus is on English, and sp...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید