Sciweavers

2373 search results - page 234 / 475
» On the Theory of Structural Subtyping
Sort
View
ACL
2012
13 years 9 months ago
Towards the Unsupervised Acquisition of Discourse Relations
This paper describes a novel approach towards the empirical approximation of discourse relations between different utterances in texts. Following the idea that every pair of event...
Christian Chiarcos
EUROCRYPT
2012
Springer
13 years 9 months ago
Improving the Complexity of Index Calculus Algorithms in Elliptic Curves over Binary Fields
Abstract. The goal of this paper is to further study the index calculus method that was first introduced by Semaev for solving the ECDLP and later developed by Gaudry and Diem. In...
Jean-Charles Faugère, Ludovic Perret, Chris...
178
Voted
WWW
2007
ACM
16 years 7 months ago
Random web crawls
This paper proposes a random Web crawl model. A Web crawl is a (biased and partial) image of the Web. This paper deals with the hyperlink structure, i.e. a Web crawl is a graph, w...
Toufik Bennouas, Fabien de Montgolfier
WWW
2004
ACM
16 years 7 months ago
The powerrank web link analysis algorithm
The web graph follows the power law distribution and has a hierarchy structure. But neither the PageRank algorithm nor any of its improvements leverage these attributes. In this p...
Yizhou Lu, Benyu Zhang, Wensi Xi, Zheng Chen, Yi L...
SODA
2010
ACM
200views Algorithms» more  SODA 2010»
16 years 4 months ago
Fully-Functional Succinct Trees
We propose new succinct representations of ordinal trees, which have been studied extensively. It is known that any n-node static tree can be represented in 2n + o(n) bits and a l...
Kunihiko Sadakane, Gonzalo Navarro