115 citations
- Cornell UniversityUS2 papers
- Courant Institute of Mathematical SciencesUS2 papers
- The University of TokyoJP2 papers
- University of California, DavisUS2 papers
- University of Illinois Urbana-ChampaignUS2 papers
- Amsterdam University of the ArtsNL1 paper
- Georgia Institute of TechnologyUS1 paper
- Harvard University PressUS1 paper
- Hebrew University of JerusalemIL1 paper
- IIT@MITUS1 paper
- Joint Institute for Laboratory AstrophysicsUS1 paper
- Laboratory for Atmospheric and Space PhysicsUS1 paper
15 papers · 1 filter
Phase transition for Local Search on planted SAT
Andrei A. Bulatov, Evgeny S. Skvortsov
The Local Search algorithm (or Hill Climbing, or Iterative Improvement) is one of the simplest heuristics to solve the Satisfiability and Max-Satisfiability problems. It is a part…
A Heterogeneous High Dimensional Approximate Nearest Neighbor Algorithm
Moshe Dubiner
We consider the problem of finding high dimensional approximate nearest neighbors. Suppose there are d independent rare features, each having its own independent statistics. A poin…
Capacity of Steganographic Channels
Jeremiah J. Harmsen, William A. Pearlman
This work investigates a central problem in steganography, that is: How much data can safely be hidden without being detected? To answer this question, a formal definition of stega…
A Simple Linear Ranking Algorithm Using Query Dependent Intercept Variables
Nir Ailon
The LETOR website contains three information retrieval datasets used as a benchmark for testing machine learning ideas for ranking. Algorithms participating in the challenge are re…
LSST and the Dark Sector: Image Processing Challenges
J. A. Tyson, C. Roat, J. Bosch +1
Next generation probes of dark matter and dark energy require high precision reconstruction of faint galaxy shapes from hundreds of dithered exposures. Current practice is to stack…
General Auction Mechanism for Search Advertising
Gagan Aggarwal, S. Muthukrishnan, David Pal +1
In sponsored search, a number of advertising slots is available on a search results page, and have to be allocated among a set of advertisers competing to display an ad on the page…