Skip to search formSkip to main content

You are currently offline. Some features of the site may not work correctly.

Semantic Scholar uses AI to extract papers important to this topic.

2017

2017

We study the problem of testing identity against a given distribution (a.k.a. goodness-of-fit) with a focus on the high… Expand

Is this relevant?

2017

2017

We present an algorithm for the statistical learning setting with a bounded exp-concave loss in $d$ dimensions that obtains… Expand

Is this relevant?

Highly Cited

2017

Highly Cited

2017

In deep learning, \textit{depth}, as well as \textit{nonlinearity}, create non-convex loss surfaces. Then, does depth alone… Expand

Is this relevant?

Highly Cited

2014

Highly Cited

2014

We are given a graph G with n vertices, where a random subset of k vertices has been made into a clique, and the remaining edges… Expand

Is this relevant?

Highly Cited

2011

Highly Cited

2011

In this paper, an algorithm is proposed for the design of low complexity linear phase finite impulse response (FIR) filters with… Expand

Is this relevant?

2011

2011

This paper proposes a method for solving the problem of avoiding pincer moves of the ghosts in the game of Ms. Pac-Man to enhance… Expand

Is this relevant?

Highly Cited

2009

Highly Cited

2009

Background: Addressing the nutritional needs of adolescents could be an important step towards breaking the vicious cycle of… Expand

Is this relevant?

Highly Cited

2007

Highly Cited

2007

Programs written in C and C++ are susceptible to memory errors, including buffer overflows and dangling pointers. These errors… Expand

Is this relevant?

Highly Cited

1993

Highly Cited

1993

This thesis argues for two main points: (1) 1. Licensing relations are sisterhood relations 2. All phrases in Dutch have the… Expand

Is this relevant?

Highly Cited

1990

Highly Cited

1990

We show how to efficiently construct a small probability space on n binary random variables such that for every subset, its… Expand

Is this relevant?