1647 search results - page 120 / 330 » Improved Randomized Approximation Algorithms for Lot-Sizing ... |
146
click to vote
FOCS
2005
IEEE
15 years 10 months ago
2005
IEEE
In the CLOSEST SUBSTRING problem k strings s1, ..., sk are given, and the task is to find a string s of length L such that each string si has a consecutive substring of length L ...
127
click to vote
ESA
2010
Springer
15 years 6 months ago
2010
Springer
The inability to answer proximity queries efficiently for spaces of dimension d > 2 has led to the study of approximation to proximity problems. Several techniques have been pro...
113
click to vote
CRYPTO
2009
Springer
15 years 11 months ago
2009
Springer
In the Hidden Number Problem (HNP), the goal is to find a hidden number s, when given p, g and access to an oracle that on query a returns the k most significant bits of s · ga ...
149
click to vote
MMB
2004
Springer
15 years 10 months ago
2004
Springer
Rate measurements are required for many purposes, e.g. for system analysis and modelling or for live systems that react to measurements. For off-line measurement all data is avail...
153
click to vote
IM
2007
15 years 4 months ago
2007
Abstract. In this paper, we consider the problem of calculating fast and accurate approximations to the personalized PageRank score of a webpage. We focus on techniques to improve ...