2079 search results - page 197 / 416 » Universality of random graphs |
214
click to vote
BDA
2004
15 years 8 months ago
2004
XQuery is the emerging standard for querying XML data sources. XLive is a light XML/XQuery mediator developed at University of Versailles whose engine processes an XML algebra der...
145
click to vote
ARSCOM
2008
15 years 6 months ago
2008
Given a graph G, we say S V (G) is resolving if for each pair of distinct u, v V (G) there is a vertex x in S where d(u, x) = d(v, x). The metric dimension of G is the minimum c...
207
click to vote
TIP
2010
15 years 5 months ago
2010
—We present in this paper a general formulation for nonnegative data factorization, called projective nonnegative graph embedding (PNGE), which 1) explicitly decomposes the data ...
164
click to vote
ERSA
2006
2006
GifT: A Gravity-Directed and Life-Time Based Algorithm for Temporal Partitioning of Data Flow Graphs
15 years 8 months ago
In reconfigurable systems, reconfiguration latency has a significant impact on the system performance. In this work, a temporal partitioning algorithm is presented to partition da...
181
click to vote
GD
2000
Springer
15 years 10 months ago
2000
Springer
An orthogonal drawing of a graph is an embedding of the graph in the rectangular grid, with vertices represented by axis-aligned boxes, and edges represented by paths in the grid w...