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
31
click to vote
CCCG
2009
favorite
Email
discuss
report
119
views
Computational Geometry
»
more
CCCG 2009
»
Streaming 1-Center with Outliers in High Dimensions
13 years 8 months ago
Download
cccg.ca
We study the 1-center problem with outliers in highdimensional data streams. The problem definition is as follows: given a sequence of n points in d dimensions (with d arbitrarily large), enclose all but z points using a ball of minimum radius.
Hamid Zarrabi-Zadeh, Asish Mukhopadhyay
Real-time Traffic
1-center Problem
|
Arbitrarily Large
|
CCCG 2009
|
Computational Geometry
|
Problem Definition
|
claim paper
Related Content
»
A Simple Streaming Algorithm for Minimum Enclosing Balls
more »
Post Info
More Details (n/a)
Added
16 Feb 2011
Updated
16 Feb 2011
Type
Journal
Year
2009
Where
CCCG
Authors
Hamid Zarrabi-Zadeh, Asish Mukhopadhyay
Comments
(0)
Researcher Info
Computational Geometry Study Group
Computer Vision