Sciweavers

721 search results - page 68 / 145
» Almost universal graphs
Sort
View
BDA
2004
13 years 11 months ago
Tree Graph Views: On Efficient Evaluation of XQuery in an XML Mediator
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...
Tuyet-Tram Dang-Ngoc, Georges Gardarin, Nicolas Tr...
ARSCOM
2008
192views more  ARSCOM 2008»
13 years 10 months ago
Bounds on the metric and partition dimensions of a graph
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...
Glenn G. Chappell, John G. Gimbel, Chris Hartman
CORR
2010
Springer
90views Education» more  CORR 2010»
13 years 10 months ago
Logical complexity of graphs: a survey
We discuss the definability of finite graphs in first-order logic with two relation symbols for adjacency and equality of vertices. The logical depth D(G) of a graph G is equal to ...
Oleg Pikhurko, Oleg Verbitsky
TIP
2010
154views more  TIP 2010»
13 years 8 months ago
Projective Nonnegative Graph Embedding
—We present in this paper a general formulation for nonnegative data factorization, called projective nonnegative graph embedding (PNGE), which 1) explicitly decomposes the data ...
Xiaobai Liu, Shuicheng Yan, Hai Jin
ERSA
2006
86views Hardware» more  ERSA 2006»
13 years 11 months ago
GifT: A Gravity-Directed and Life-Time Based Algorithm for Temporal Partitioning of Data Flow Graphs
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...
Farhad Mehdipour, Morteza Saheb Zamani, Mehdi Sedi...