1089 search results - page 89 / 218 » Randomness and Reducibility |
AAAI
2007
14 years 17 days ago
2007
The mean running time of a Las Vegas algorithm can often be dramatically reduced by periodically restarting it with a fresh random seed. The optimal restart schedule depends on th...
ISVLSI
2003
IEEE
14 years 3 months ago
2003
IEEE
This paper describes a technique for re-ordering of scan cells to minimize power dissipation that is also capable of reducing the area overhead of the circuit compared to a random...
ICML
2010
IEEE
13 years 11 months ago
2010
IEEE
Hashing based Approximate Nearest Neighbor (ANN) search has attracted much attention due to its fast query time and drastically reduced storage. However, most of the hashing metho...
TIT
2008
13 years 10 months ago
2008
The minimum distance is one of the most important combinatorial characterizations of a code. The maximum likelihood decoding problem is one of the most important algorithmic proble...
ICCS
2007
Springer
14 years 4 months ago
2007
Springer
In this paper, active learning with support vector machines (SVMs) is applied to the problem of tornado prediction. This method is used to predict which storm-scale circulations yi...