241 search results - page 7 / 49 » Graphs, Hypergraphs and Hashing |
131
Voted
ICML
2007
IEEE
16 years 2 months ago
2007
IEEE
The paper presents a kernel for learning from ordered hypergraphs, a formalization that captures relational data as used in Inductive Logic Programming (ILP). The kernel generaliz...
115
click to vote
TCS
2010
14 years 8 months ago
2010
In this paper we show that the problem of finding a chordless path between a vertex s and a vertex t containing a vertex v remains NP-complete in bipartite graphs, thereby strengt...
GG
2008
Springer
15 years 2 months ago
2008
Springer
We consider four different models of process interactions that unify and generalise models introduced and studied by Angluin et al. [AAD+ 04] and models introduced and studied by ...
110
Voted
COMBINATORICA
2007
15 years 1 months ago
2007
The main result of this paper is that every 4-uniform hypergraph on n vertices and m edges has a transversal with no more than (5n + 4m)/21 vertices. In the particular case n = m,...
145
Voted
ICALP
2009
Springer
16 years 2 months ago
2009
Springer
Abstract. This paper deals with approximations of maximum independent sets in non-uniform hypergraphs of low degree. We obtain the first performance ratio that is sublinear in term...