1722 search results - page 50 / 345 » Variables in Concept Graphs |
172
click to vote
NAACL
2003
15 years 7 months ago
2003
e by placing terms in an abstract ‘information space’ based on their occurrences in text corpora, and then allowing a user to visualize local regions of this information space....
144
click to vote
DM
2008
15 years 6 months ago
2008
A simple graph G is k-ordered (respectively, k-ordered hamiltonian) if, for any sequence of k distinct vertices v1, . . . , vk of G, there exists a cycle (respectively, a hamilton...
173
click to vote
STOC
2006
ACM
16 years 6 months ago
2006
ACM
Gowers [Gow98, Gow01] introduced, for d 1, the notion of dimension-d uniformity Ud (f) of a function f : G C, where G is a finite abelian group. Roughly speaking, if a function ...
129
click to vote
STACS
2010
Springer
16 years 1 months ago
2010
Springer
Abstract. A parametric weighted graph is a graph whose edges are labeled with continuous real functions of a single common variable. For any instantiation of the variable, one obta...
178
click to vote
ECBS
2002
IEEE
15 years 11 months ago
2002
IEEE
This paper discusses an approach for top-down composition of software architectures. First, an architecture is derived that addresses functional requirements only. This architectu...