SIGN IN
SIGN UP
Programmable clustering
Full Text:
Pdf
Buy this Article
Authors:
Sreenivas Gollapudi
Ebrary Inc., Palo Alto, CA
Ravi Kumar
Yahoo! Research, Sunnyvale, CA
D. Sivakumar
Google Inc., Mountain View, CA
Published in:
· Proceeding
PODS '06
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Pages 348 - 354
ACM
New York, NY
, USA
©2006
table of contents
ISBN:1-59593-318-2
doi>
10.1145/1142351.1142400
2006 Article
Bibliometrics
· Downloads (6 Weeks): 3
· Downloads (12 Months): 35
· Downloads (cumulative): 718
· Citation Count: 1
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Upcoming Conference:
SIGMOD/PODS'13
Share:
|
Tags:
algorithms
algorithms
clustering
clustering
first-order formula
geometrical problems and computations
theory
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder