241 search results - page 8 / 49 » Graphs, Hypergraphs and Hashing |
157
click to vote
LION
2009
Springer
15 years 8 months ago
2009
Springer
This work introduces new bounds on the clique number of graphs derived from a result due to S´os and Straus, which generalizes the Motzkin-Straus Theorem to a specific class of h...
104
click to vote
WG
2005
Springer
15 years 7 months ago
2005
Springer
We review the concepts of hypertree decomposition and hypertree width from a graph theoretical perspective and report on a number of recent results related to these concepts. We al...
112
click to vote
FOCS
2006
IEEE
15 years 8 months ago
2006
IEEE
Given an undirected hypergraph and a subset of vertices S ⊆ V with a specified root vertex r ∈ S, the STEINER ROOTED-ORIENTATION problem is to find an orientation of all the...
112
click to vote
ICML
2006
IEEE
16 years 2 months ago
2006
IEEE
Recently there has been considerable interest in learning with higher order relations (i.e., three-way or higher) in the unsupervised and semi-supervised settings. Hypergraphs and...
83
Voted
FCT
2005
Springer
15 years 7 months ago
2005
Springer
: In this paper, we investigate the problem to find an acyclic subhypergraph in a given hypergraph, which is an extension to find a tree in a graph. First, we introduce a spannin...