Sciweavers

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

105

Voted

TALG
2010

52views more TALG 2010»

Approximating the distance to monotonicity in high dimensions

15 years 1 months ago

Approximating the distance to monotonicity in high dimensions

Download www.eng.tau.ac.il

Shahar Fattal, Dana Ron

Real-time Traffic

TALG 2010 |

claim paper

Related Content

» HighDimensional Similarity Retrieval Using Dimensional Choice

» Parallel monotonicity reconstruction

» Similarity Search in High Dimensions via Hashing

» Element Rearrangement for TensorBased Subspace Learning

» Coresets and Sketches for High Dimensional Subspace Approximation Problems

» Intrinsic dimension of a dataset what properties does one expect

» Adaptive Cluster Distance Bounding for HighDimensional Indexing

» Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces

» What is the furthest graph from a hereditary property

Post Info
More Details (n/a)

Added	30 Jan 2011
Updated	30 Jan 2011
Type	Journal
Year	2010
Where	TALG
Authors	Shahar Fattal, Dana Ron

Comments (0)