1648 search results - page 111 / 330 » On the generation of bicliques of a graph |
163
click to vote
WEBI
2009
Springer
15 years 11 months ago
2009
Springer
— This paper presents a novel method of generating extractive summaries for multiple documents. Given a cluster of documents, we firstly construct a graph where each vertex repre...
162
click to vote
STOC
1994
ACM
15 years 10 months ago
1994
ACM
Let G(3n, p, 3) be a random 3-colorable graph on a set of 3n vertices generated as follows. First, split the vertices arbitrarily into three equal color classes and then choose ev...
214
click to vote
ECML
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. We present a new reinforcement learning approach for deterministic continuous control problems in environments with unknown, arbitrary reward functions. The difficulty of...
170
click to vote
AAAI
2006
15 years 7 months ago
2006
We present a new method for mapping ontology schemas that address similar domains. The problem of ontology mapping is crucial since we are witnessing a decentralized development a...
167
click to vote
CATS
2006
15 years 7 months ago
2006
A complete description and proof of correctness are given for a new polynomial time algorithm for a class of codes based on directed graphs and involving construction well known i...