1449 search results - page 235 / 290 » Self-Randomized Exponentiation Algorithms |
147
click to vote
ICML
2002
IEEE
16 years 6 months ago
2002
IEEE
We present several new algorithms for multiagent reinforcement learning. A common feature of these algorithms is a parameterized, structured representation of a policy or value fu...
148
click to vote
RECOMB
2007
Springer
16 years 6 months ago
2007
Springer
The study of biological networks and network motifs can yield significant new insights into systems biology. Previous methods of discovering network motifs ? network-centric subgra...
194
click to vote
STOC
2004
ACM
16 years 6 months ago
2004
ACM
Abstract. In the late nineties, Erickson proved a remarkable lower bound on the decision tree complexity of one of the central problems of computational geometry: given n numbers, ...
187
click to vote
STOC
2001
ACM
16 years 6 months ago
2001
ACM
We study two fundamental static data structure problems, membership and perfect hashing, in Yao's cell probe model. The first space and bit probe optimal worst case upper bou...
171
click to vote
EDBT
2006
ACM
16 years 6 months ago
2006
ACM
In many decision-making applications, the skyline query is frequently used to find a set of dominating data points (called skyline points) in a multidimensional dataset. In a high-...