Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

11

COLT
1998
Springer

favoriteEmaildiscussreport

86views Machine Learning» more COLT 1998»

The Query Complexity of Finding Local Minima in the Lattice

13 years 9 months ago

The Query Complexity of Finding Local Minima in the Lattice

Download www.cs.bgu.ac.il

Amos Beimel, Felix Geller, Eyal Kushilevitz

Real-time Traffic

COLT 1998 | Machine Learning |

claim paper

Related Content

» Lower bounds for local search by quantum arguments

» Building Roadmaps of Local Minima of Visual Models

» HumanGuided Simple Search

» Quantum and Randomized Lower Bounds for Local Search on VertexTransitive Graphs

» Avoiding Divergence in the ShalviWeinstein Algorithm

» Quantum and classical query complexities of local search are polynomially related

» Query adaptative locality sensitive hashing

» Discovering colocated queries in geographic search logs

» IsoContour Queries and Gradient Descent with Guaranteed Delivery in Sensor Networks

Post Info
More Details (n/a)

Added	05 Aug 2010
Updated	05 Aug 2010
Type	Conference
Year	1998
Where	COLT
Authors	Amos Beimel, Felix Geller, Eyal Kushilevitz

Comments (0)