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
35
click to vote
CPC
2011
favorite
Email
discuss
report
215
views
Education
»
more
CPC 2011
»
An Improved Bound for k-Sets in Four Dimensions
13 years 5 months ago
Download
www.math.tau.ac.il
We show that the number of halving sets of a set of n points in R4 is O n4−1/18 , improving the previous bound of [9] with a simpler (albeit similar) proof.
Micha Sharir
Real-time Traffic
CPC 2011
|
Education
|
Halving
|
Simpler
|
claim paper
Related Content
»
kSets in Four Dimensions
»
Improved Delsarte bounds for spherical codes in small dimensions
»
Generic Density and Small Span Theorem
»
Distance estimation and object location via rings of neighbors
»
The Partition Technique for Overlays of Envelopes
»
Efficient subset selection based on the Renyi entropy
»
Automatic online tuning for fast Gaussian summation
more »
Post Info
More Details (n/a)
Added
13 May 2011
Updated
13 May 2011
Type
Journal
Year
2011
Where
CPC
Authors
Micha Sharir
Comments
(0)
Researcher Info
CPC 2010 Study Group
Computer Vision