Sciweavers

193 search results - page 22 / 39
» Exponential lower bounds for the numbers of Skolem-type sequ...
Sort
View
AIEDAM
2008
127views more  AIEDAM 2008»
13 years 8 months ago
Evolving blackbox quantum algorithms using genetic programming
Although it is known that quantum computers can solve certain computational problems exponentially faster than classical computers, only a small number of quantum algorithms have ...
Ralf Stadelhofer, Wolfgang Banzhaf, Dieter Suter
AAAI
1992
13 years 9 months ago
Inferring Finite Automata with Stochastic Output Functions and an Application to Map Learning
It is often useful for a robot to construct a spatial representation of its environment from experiments and observations, in other words, to learn a map of its environment by exp...
Thomas Dean, Dana Angluin, Kenneth Basye, Sean P. ...
STOC
1993
ACM
87views Algorithms» more  STOC 1993»
14 years 17 days ago
How to use expert advice
We analyze algorithms that predict a binary value by combining the predictions of several prediction strategies, called experts. Our analysis is for worst-case situations, i.e., we...
Nicolò Cesa-Bianchi, Yoav Freund, David P. ...
SIGMOD
2012
ACM
210views Database» more  SIGMOD 2012»
11 years 11 months ago
Interactive regret minimization
We study the notion of regret ratio proposed in [19] to deal with multi-criteria decision making in database systems. The regret minimization query proposed in [19] was shown to h...
Danupon Nanongkai, Ashwin Lall, Atish Das Sarma, K...
CORR
2008
Springer
74views Education» more  CORR 2008»
13 years 8 months ago
On Certain Large Random Hermitian Jacobi Matrices with Applications to Wireless Communications
In this paper we study the spectrum of certain large random Hermitian Jacobi matrices. These matrices are known to describe certain communication setups. In particular we are inte...
Nathan Levy, Oren Somekh, Shlomo Shamai, Ofer Zeit...