1722 search results - page 176 / 345 » Variables in Concept Graphs |
JUCS
2002
14 years 9 months ago
2002
: Let G = (V, E) be a strongly connected and aperiodic directed graph of uniform out-degree k. A deterministic finite automaton is obtained if the edges are colored with k colors i...
115
Voted
EJC
2011
14 years 5 months ago
2011
A D-polyhedron is a polyhedron P such that if x, y are in P then so are their componentwise max and min. In other words, the point set of a D-polyhedron forms a distributive latti...
99
Voted
EOR
2010
14 years 10 months ago
2010
Abstract: Probabilistically constrained problems, in which the random variables are finitely distributed, are nonconvex in general and hard to solve. The p-efficiency concept has b...
IJIT
2004
14 years 11 months ago
2004
Both software applications and their development environment are becoming more and more distributed. This trend impacts not only the way software computes, but also how it looks. T...
77
Voted
EMNLP
2010
14 years 8 months ago
2010
Although many algorithms have been developed to harvest lexical resources, few organize the mined terms into taxonomies. We propose (1) a semi-supervised algorithm that uses a roo...