Sciweavers

2157 search results - page 84 / 432
» Optimal Fast Hashing
Sort
View
ICML
2009
IEEE
15 years 11 months ago
Fast evolutionary maximum margin clustering
The maximum margin clustering approach is a recently proposed extension of the concept of support vector machines to the clustering problem. Briefly stated, it aims at finding a...
Fabian Gieseke, Tapio Pahikkala, Oliver Kramer
INFOCOM
2009
IEEE
15 years 10 months ago
Fast Algorithms and Performance Bounds for Sum Rate Maximization in Wireless Networks
Abstract— Sum rate maximization by power control is an important, challenging, and extensively studied problem in wireless networks. It is a nonconvex optimization problem and ac...
Chee-Wei Tan, Mung Chiang, R. Srikant
ICPR
2008
IEEE
15 years 10 months ago
Fast model selection for MaxMinOver-based training of support vector machines
OneClassMaxMinOver (OMMO) is a simple incremental algorithm for one-class support vector classification. We propose several enhancements and heuristics for improving model select...
Fabian Timm, Sascha Klement, Thomas Martinetz
DSN
2005
IEEE
15 years 9 months ago
Fast Byzantine Consensus
— We present the first protocol that reaches asynchronous Byzantine consensus in two communication steps in the common case. We prove that our protocol is optimal in terms of bo...
Jean-Philippe Martin, Lorenzo Alvisi
GECCO
2009
Springer
241views Optimization» more  GECCO 2009»
15 years 8 months ago
A fast high quality pseudo random number generator for nVidia CUDA
Previously either due to hardware GPU limits or older versions of software, careful implementation of PRNGs was required to make good use of the limited numerical precision availa...
William B. Langdon