5100 search results - page 269 / 1020 » The Linear Complexity of a Graph |
257
click to vote
ICDE
2002
IEEE
16 years 5 months ago
2002
IEEE
XML and other semi-structured data may have partially specified or missing schema information, motivating the use of a structural summary which can be automatically computed from ...
174
click to vote
COMPGEOM
2011
ACM
14 years 8 months ago
2011
ACM
Given a continuous function f : X → IR on a topological space X, its level set f−1 (a) changes continuously as the real value a changes. Consequently, the connected components...
173
click to vote
PPDP
1999
Springer
15 years 8 months ago
1999
Springer
hemical abstract machine Shinya Sato Himeji Dokkyo University, Faculty of Econoinformatics, 7-2-1 Kamiohno, Himeji-shi, Hyogo 670-8524, Japan Ian Mackie LIX, CNRS UMR 7161, ´Ecole...
146
click to vote
CORR
2010
Springer
15 years 2 months ago
2010
Springer
Abstract--This paper investigates the uniqueness of a nonnegative vector solution and the uniqueness of a positive semidefinite matrix solution to underdetermined linear systems. A...
134
click to vote
COCOA
2008
Springer
15 years 6 months ago
2008
Springer
In a finite simple undirected graph, a vertex is simplicial if its neighborhood is a clique. We say that, for k 2, a graph G = (VG, EG) is the k-simplicial power of a graph H = (V...