2304 search results - page 257 / 461 » On the Vulnerability of Large Graphs |
200
click to vote
NAACL
2010
15 years 4 months ago
2010
We present a random-walk-based approach to learning paraphrases from bilingual parallel corpora. The corpora are represented as a graph in which a node corresponds to a phrase, an...
201
click to vote
DCC
2005
IEEE
16 years 6 months ago
2005
IEEE
We give an overview of some of the mathematical results of Dominique de Caen. These include a short proof of K?onig's theorem, results on Tur?an numbers, biclique partitions,...
173
click to vote
APVIS
2003
15 years 8 months ago
2003
In this paper techniques from multidimensional scaling and graph drawing are coupled to provide an overview-and-detail style method for visualising a high dimensional dataset whos...
148
click to vote
CORR
2002
Springer
15 years 6 months ago
2002
Springer
We give a precise definition of "generic-case complexity" and show that for a very large class of finitely generated groups the classical decision problems of group theor...
147
click to vote
RSA
2008
15 years 6 months ago
2008
: We study a model of random uniform hypergraphs, where a random instance is obtained by adding random edges to a large hypergraph of a given density. The research on this model fo...