5227 search results - page 239 / 1046 » Constructing New Media |
190
click to vote
ENDM
2008
15 years 7 months ago
2008
For a family F of graphs, a graph U is said to be F-universal if every graph of F is a subgraph of U. Similarly, a graph is said to be F-induced-universal if every graph of F is a...
133
click to vote
DLOG
2007
15 years 9 months ago
2007
We present an new Prot´eg´e plugin for constructing a minimal satisfiability model of an OWL ontology and visualizing it in the original music score notation.
180
Voted
COMBINATORICS
2000
15 years 7 months ago
2000
We define a number of new combinatorial operations on skew semistandard domino tableaux that complement constructions defined by C. Carr
239
click to vote
EMNLP
2011
14 years 7 months ago
2011
This paper describes a novel approach to the semantic relation detection problem. Instead of relying only on the training instances for a new relation, we leverage the knowledge l...
188
click to vote
TACS
2001
Springer
15 years 11 months ago
2001
Springer
Boxed Ambients are a variant of Mobile Ambients that result from (i) dropping the open capability and (ii) providing new primitives for ambient communication while retaining the co...