2168 search results - page 192 / 434 » Randomized Algorithms and Complexity Theory |
131
Voted
AVI
2006
15 years 5 months ago
2006
This methodological note focuses on the edge density of real world examples of networks. The edge density is a parameter of interest typically when putting up user studies in an e...
118
Voted
JILP
2000
15 years 3 months ago
2000
How much do two profiles of the same program differ? When has a profile changed enough to warrant reexamination of the profiled program? And how should two or more profiles be com...
144
click to vote
SODA
2008
ACM
15 years 5 months ago
2008
ACM
In this paper we consider problems related to the sortedness of a data stream. First we investigate the problem of estimating the distance to monotonicity; given a sequence of len...
131
Voted
COMPGEOM
2004
ACM
15 years 9 months ago
2004
ACM
We prove that the geometric thickness of graphs whose maximum degree is no more than four is two. In our proofs, we present a space and time efficient embedding technique for gra...
119
click to vote
MOC
2010
14 years 10 months ago
2010
The elliptic curve method (ECM) is one of the best factorization methods available. It is possible to use hyperelliptic curves instead of elliptic curves but it is in theory slower...