Sciweavers

64 search results - page 1 / 13
» Geometric Searching over the Rationals
Sort
View
ESA
1999
Springer
110views Algorithms» more  ESA 1999»
13 years 9 months ago
Geometric Searching over the Rationals
We revisit classical geometric search problems under the assumption of rational coordinates. Our main result is a tight bound for point separation, ie, to determine whether n given...
Bernard Chazelle
IACR
2011
152views more  IACR 2011»
12 years 4 months ago
Rational distance-bounding protocols over noisy channels
We use ideas from game theory to define a new notion for an optimal threshold for the number of erroneous responses that occur during the rapid-bit exchange over noisy channels i...
Long H. Nguyen
AISC
2008
Springer
13 years 6 months ago
Search Techniques for Rational Polynomial Orders
Polynomial interpretations are a standard technique used in almost all tools for proving termination of term rewrite systems (TRSs) automatically. Traditionally, one applies interp...
Carsten Fuhs, Rafael Navarro-Marset, Carsten Otto,...
ANTS
2006
Springer
79views Algorithms» more  ANTS 2006»
13 years 8 months ago
Computing a Lower Bound for the Canonical Height on Elliptic Curves over Q
Let E be an elliptic curve over the rationals. A crucial step in determining a Mordell-Weil basis for E is to exhibit some positive lower bound > 0 for the canonical height ^h ...
John Cremona, Samir Siksek
CEC
2005
IEEE
13 years 10 months ago
Geometric landscape of homologous crossover for syntactic trees
The relationship between search space, distances and genetic operators for syntactic trees is little understood. Geometric crossover and geometric mutation are representation-indep...
Alberto Moraglio, Riccardo Poli