Sciweavers

3208 search results - page 302 / 642
» A Lower Bound for Primality
Sort
View
JMLR
2010
105views more  JMLR 2010»
15 years 1 months ago
Classification Methods with Reject Option Based on Convex Risk Minimization
In this paper, we investigate the problem of binary classification with a reject option in which one can withhold the decision of classifying an observation at a cost lower than t...
Ming Yuan, Marten H. Wegkamp
172
Voted
ICASSP
2011
IEEE
14 years 10 months ago
Pilot optimization for time-delay and channel estimation in OFDM systems
Orthogonal frequency division multiplexing (OFDM) communication systems require accurate estimation of timing offset and channel impulse response in order to achieve desirable per...
Michael D. Larsen, Gonzalo Seco-Granados, A. Lee S...
APPROX
2011
Springer
284views Algorithms» more  APPROX 2011»
14 years 6 months ago
On Approximating the Number of Relevant Variables in a Function
In this work we consider the problem of approximating the number of relevant variables in a function given query access to the function. Since obtaining a multiplicative factor ap...
Dana Ron, Gilad Tsur
CORR
2012
Springer
229views Education» more  CORR 2012»
14 years 2 months ago
Cops and Invisible Robbers: the Cost of Drunkenness
We examine a version of the Cops and Robber (CR) game in which the robber is invisible, i.e., the cops do not know his location until they capture him. Apparently this game (CiR) h...
Athanasios Kehagias, Dieter Mitsche, Pawel Pralat
SODA
2012
ACM
170views Algorithms» more  SODA 2012»
13 years 9 months ago
Compression via matroids: a randomized polynomial kernel for odd cycle transversal
The Odd Cycle Transversal problem (OCT) asks whether a given graph can be made bipartite by deleting at most k of its vertices. In a breakthrough result Reed, Smith, and Vetta (Op...
Stefan Kratsch, Magnus Wahlström