4066 search results - page 40 / 814 » Almost Complete Sets |
FOCS
1994
IEEE
14 years 2 months ago
1994
IEEE
We establish a nonlinear lower bound for halfplane range searching over a group. Specifically, we show that summing up the weights of n (weighted) points within n halfplanes requir...
ASIACRYPT
2008
Springer
13 years 12 months ago
2008
Springer
Optimistic fair exchange (OFE) is a protocol for solving the problem of exchanging items or services in a fair manner between two parties, a signer and a verifier, with the help o...
JUCS
2007
13 years 9 months ago
2007
: We give a tight analysis of an old and popular sweep-line heuristic for constructing a spanning tree of a set of n points in the plane. The algorithm sweeps a vertical line acros...
INTERSPEECH
2010
13 years 4 months ago
2010
Our goal is to automatically learn a perceptually-optimal target cost function for a unit selection speech synthesiser. The approach we take here is to train a classifier on human...
CSFW
2006
IEEE
14 years 4 months ago
2006
IEEE
An attack mutation algorithm takes a known instance of an attack and transforms it into many distinct instances by repeatedly applying attack transformations. Such algorithms are ...