1208 search results - page 22 / 242 » Uniform eventown problems |
105
click to vote
FPT
2005
IEEE
15 years 5 months ago
2005
IEEE
This paper describes a class of FPGA-specific uniform random number generators with a 2k −1 length period, which can provide k random bits per-cycle for the cost of k Lookup Ta...
HAPTICS
2005
IEEE
15 years 5 months ago
2005
IEEE
— We present an algorithm that determines the point on a convex parametric surface patch that is closest to a given (possibly moving) point. Any initial point belonging to the su...
112
click to vote
COCO
2008
Springer
15 years 1 months ago
2008
Springer
We introduce a simple game family, called Constraint Logic, where players reverse edges in a directed graph while satisfying vertex in-flow constraints. This game family can be in...
100
click to vote
TALG
2008
14 years 11 months ago
2008
Abstract. We present a new analysis of the well-known family of multiplicative hash functions, and improved deterministic algorithms for selecting "good" hash functions. ...
STOC
2007
ACM
15 years 12 months ago
2007
ACM
In 1998, Impagliazzo and Wigderson [IW98] proved a hardness vs. randomness tradeoff for BPP in the uniform setting, which was subsequently extended to give optimal tradeoffs for t...