278 search results - page 13 / 56 » Algorithmic randomness and monotone complexity on product sp... |
CORR
2010
Springer
13 years 8 months ago
2010
Springer
Finding the product of two polynomials is an essential and basic problem in computer algebra. While most previous results have focused on the worst-case complexity, we instead emp...
ALIFE
2007
13 years 8 months ago
2007
Animals use diverse forms of communication, from sound signals to body postures. Recent ethological studies have reported a unique syntactic communication of a songbird, the Bengal...
APPROX
2010
Springer
13 years 10 months ago
2010
Springer
We give a simple combinatorial proof of the Chernoff-Hoeffding concentration bound [Che52, Hoe63], which says that the sum of independent {0, 1}-valued random variables is highly ...
ICALP
2004
Springer
14 years 1 months ago
2004
Springer
We define a natural notion of efficiency for approximate nearest-neighbor (ANN) search in general n-point metric spaces, namely the existence of a randomized algorithm which answ...
INFOVIS
2000
IEEE
14 years 25 days ago
2000
IEEE
COMIND is a tool for conceptual design of industrial products. It helps designers define and evaluate the initial design space by using search algorithms to generate sets of feasi...