Sciweavers

2157 search results - page 90 / 432
» Binary ant algorithm
Sort
View
76
Voted
FOCS
2008
IEEE
15 years 7 months ago
The Bayesian Learner is Optimal for Noisy Binary Search (and Pretty Good for Quantum as Well)
We use a Bayesian approach to optimally solve problems in noisy binary search. We deal with two variants: • Each comparison is erroneous with independent probability 1 − p. ...
Michael Ben-Or, Avinatan Hassidim
118
Voted
ANTS
2010
Springer
263views Algorithms» more  ANTS 2010»
15 years 3 months ago
Computing Automorphic Forms on Shimura Curves over Fields with Arbitrary Class Number
We extend methods of Greenberg and the author to compute in the cohomology of a Shimura curve defined over a totally real field with arbitrary class number. Via the Jacquet-Langlan...
John Voight
89
Voted
ICCAD
1994
IEEE
109views Hardware» more  ICCAD 1994»
15 years 4 months ago
Efficient breadth-first manipulation of binary decision diagrams
We propose new techniques for efficient breadth-first iterative manipulation of ROBDDs. Breadth-first iterative ROBDD manipulation can potentially reduce the total elapsed time by...
Pranav Ashar, Matthew Cheong
100
Voted
IJNSEC
2006
94views more  IJNSEC 2006»
15 years 13 days ago
A Binary Redundant Scalar Point Multiplication in Secure Elliptic Curve Cryptosystems
The main back-bone operation in elliptic curve cryptosystems is scalar point multiplication. The most frequently used method implementing the scalar point multiplication which is ...
Sangook Moon
ISMIR
2005
Springer
170views Music» more  ISMIR 2005»
15 years 6 months ago
Applications of Binary Classification and Adaptive Boosting to the Query-By-Humming Problem
In the “query-by-humming” problem, we attempt to retrieve a specific song from a target set based on a sung query. Recent evaluations of query-by-humming systems show that th...
Charles L. Parker