Sciweavers

1039 search results - page 157 / 208
» Kernels and Regularization on Graphs
Sort
View
ARSCOM
1998
79views more  ARSCOM 1998»
14 years 11 months ago
A characterization of halved cubes
The vertex set of a halved cube Qd consists of a bipartition vertex set of a cube Qd and two vertices are adjacent if they have a common neighbour in the cube. Let d ≥ 5. Then i...
Wilfried Imrich, Sandi Klavzar, Aleksander Vesel
COMBINATORICS
1998
84views more  COMBINATORICS 1998»
14 years 11 months ago
Multimatroids II. Orthogonality, minors and connectivity
A multimatroid is a combinatorial structure that encompasses matroids, delta-matroids and isotropic systems. This structure has been introduced to unify a theorem of Edmonds on th...
André Bouchet
JMLR
2010
158views more  JMLR 2010»
14 years 6 months ago
Topology Selection in Graphical Models of Autoregressive Processes
An algorithm is presented for topology selection in graphical models of autoregressive Gaussian time series. The graph topology of the model represents the sparsity pattern of the...
Jitkomut Songsiri, Lieven Vandenberghe
SPAA
2009
ACM
16 years 11 days ago
On randomized representations of graphs using short labels
Informative labeling schemes consist in labeling the nodes of graphs so that queries regarding any two nodes (e.g., are the two nodes adjacent?) can be answered by inspecting mere...
Pierre Fraigniaud, Amos Korman
FQAS
2009
Springer
127views Database» more  FQAS 2009»
15 years 6 months ago
Finding Top-k Approximate Answers to Path Queries
We consider the problem of finding and ranking paths in semistructured data without necessarily knowing its full structure. The query language we adopt comprises conjunctions of r...
Carlos A. Hurtado, Alexandra Poulovassilis, Peter ...