output
20032025
most citedNatural Language Processing (almost) from Scratch

5.2k citations

researchers with a paper here

Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.

collaborating institutions
Showing 2010Show all

7 papers · 1 filter

math.CO2010

Order Types of convex bodies

Alfredo Hubard, Luis Montejano, Emiliano Mora +1

We give new bounds on the Erdos-Szekeres theorems for convex bodies of Bisztriczky and Fejes Toth and of Pach and Toth. We derive them from a combinatorial characterization of conv…

cs.CV2010★ 197 cited

Fast Inference in Sparse Coding Algorithms with Applications to Object Recognition

Koray Kavukcuoglu, Marc'Aurelio Ranzato, Yann LeCun

Adaptive sparse coding methods learn a possibly overcomplete set of basis functions, such that natural image patches can be reconstructed by linearly combining a small subset of th…

math.MG2010★ 3 cited

Absolutely minimal Lipschitz extension of tree-valued mappings

Assaf Naor, Scott Sheffield

We prove that every Lipschitz function from a subset of a locally compact length space to a metric tree has a unique absolutely minimal Lipschitz extension (AMLE). We relate these…

math.AP2010★ 4 cited

Global existence of weak solutions to the FENE dumbbell model of polymeric flows

Nader Masmoudi

Systems coupling fluids and polymers are of great interest in many branches of sciences. One of the models to describe them is the FENE (Finite Extensible Nonlinear Elastic) dumbbe…

math.DS2010

Dynamics of Periodically-kicked Oscillators

Kevin K. Lin, Lai-Sang Young

We review some recent results surrounding a general mechanism for producing chaotic behavior in periodically-kicked oscillators. The key geometric ideas are illustrated via a simpl…

math.MG2010★ 3 cited

Scale-oblivious metric fragmentation and the nonlinear Dvoretzky theorem

Assaf Naor, Terence Tao

We introduce a randomized iterative fragmentation procedure for finite metric spaces, which is guaranteed to result in a polynomially large subset that is -equivalent to an ultr…

cs.DS2010★ 6 cited

An in-place truncated Fourier transform and applications to polynomial multiplication

David Harvey, Daniel S. Roche

The truncated Fourier transform (TFT) was introduced by van der Hoeven in 2004 as a means of smoothing the "jumps" in running time of the ordinary FFT algorithm that occur at power…