Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
28
click to vote
STOC
1999
ACM
favorite
Email
discuss
report
101
views
Algorithms
»
more
STOC 1999
»
Sublinear Time Algorithms for Metric Space Problems
14 years 25 days ago
Download
www.wisdom.weizmann.ac.il
Piotr Indyk
Real-time Traffic
Algorithms
|
STOC 1999
|
claim paper
Related Content
»
Facility Location in Sublinear Time
»
SublinearTime Approximation for Clustering Via Random Sampling
»
Sublinear Time Algorithms for Earth Movers Distance
»
A Sublinear Time Approximation Scheme for Clustering in Metric Spaces
»
Small Space Representations for Metric MinSum k Clustering and Their Applications
»
Estimating the weight of metric minimum spanning trees in sublineartime
»
Sublinear Optimization for Machine Learning
»
A SublinearTime Randomized Approximation Scheme for the RobinsonFoulds Metric
»
Bit Allocation in Sublinear Time and the MultipleChoice Knapsack Problem
more »
Post Info
More Details (n/a)
Added
03 Aug 2010
Updated
03 Aug 2010
Type
Conference
Year
1999
Where
STOC
Authors
Piotr Indyk
Comments
(0)
Researcher Info
Algorithms Study Group
Computer Vision