1331 search results - page 48 / 267 » Complexity bounds for zero-test algorithms |
NIPS
2007
13 years 9 months ago
2007
We present a simple, agnostic active learning algorithm that works for any hypothesis class of bounded VC dimension, and any data distribution. Our algorithm extends a scheme of C...
STOC
2004
ACM
14 years 8 months ago
2004
ACM
The problem of finding a local minimum of a black-box function is central for understanding local search as well as quantum adiabatic algorithms. For functions on the Boolean hype...
WDAG
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. In this paper, we present fast and fully distributed algorithms for matching in weighted trees and general weighted graphs. The time complexity as well as the approximati...
GLOBECOM
2008
IEEE
14 years 2 months ago
2008
IEEE
— Recently, a maximum likelihood (ML) detection rule for differential unitary space time modulation (DUSTM) under the existence of unknown carrier frequency offset (CFO) has been...
DCG
2010
13 years 7 months ago
2010
We present a Delaunay refinement algorithm for meshing a piecewise smooth complex in three dimensions. The algorithm protects edges with weighted points to avoid the difficulty po...