Sciweavers

534 search results - page 65 / 107
» Power from Random Strings
Sort
View
103
Voted
RANDOM
1999
Springer
15 years 4 months ago
Approximation of Multi-color Discrepancy
Abstract. In this article we introduce (combinatorial) multi{color discrepancy and generalize some classical results from 2{color discrepancy theory to ccolors. We give a recursive...
Benjamin Doerr, Anand Srivastav
102
Voted
STOC
1995
ACM
126views Algorithms» more  STOC 1995»
15 years 4 months ago
A computational view of population genetics
This paper contributes tothe study of nonlinear dynamical systems from a computational perspective. These systems are inherently more powerful than their linear counterparts (such...
Yuval Rabani, Yuri Rabinovich, Alistair Sinclair
95
Voted
AAAI
2007
15 years 2 months ago
Combining Multiple Heuristics Online
We present black-box techniques for learning how to interleave the execution of multiple heuristics in order to improve average-case performance. In our model, a user is given a s...
Matthew J. Streeter, Daniel Golovin, Stephen F. Sm...
106
Voted
WWW
2007
ACM
16 years 1 months ago
Extraction and search of chemical formulae in text documents on the web
Often scientists seek to search for articles on the Web related to a particular chemical. When a scientist searches for a chemical formula using a search engine today, she gets ar...
Bingjun Sun, Qingzhao Tan, Prasenjit Mitra, C. Lee...
CRYPTO
2004
Springer
111views Cryptology» more  CRYPTO 2004»
15 years 6 months ago
Signed Binary Representations Revisited
The most common method for computing exponentiation of random elements in Abelian groups are sliding window schemes, which enhance the efficiency of the binary method at the expens...
Katsuyuki Okeya, Katja Schmidt-Samoa, Christian Sp...