2321 search results - page 341 / 465 » Optimizing WebPage Interest |
123
Voted
ESA
2006
Springer
15 years 7 months ago
2006
Springer
We give subquadratic algorithms that, given two necklaces each with n beads at arbitrary positions, compute the optimal rotation of the necklaces to best align the beads. Here ali...
140
Voted
FSTTCS
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. We prove several results about the average-case complexity of problems in the Polynomial Hierarchy (PH). We give a connection among average-case, worst-case, and non-unif...
120
click to vote
ESOP
2000
Springer
15 years 7 months ago
2000
Springer
We present a module calculus for studying a simple model of link-time compilation. The calculus is stratified into a term calculus, a core module calculus, and a linking calculus. ...
139
Voted
FPGA
2000
ACM
15 years 7 months ago
2000
ACM
The fastest known algorithms for factoring large numbers share a core sieving technique. The sieving cores find numbers that are completely factored over a prime base set raised t...
124
click to vote
COMPGEOM
1995
ACM
15 years 7 months ago
1995
ACM
We present a competitive strategy for walking into the kernel of an initially unknown star-shaped polygon. From an arbitrary start point, s, within the polygon, our strategy find...