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
40
search results - page 3 / 8
»
focs 1999
Sort
relevance
views
votes
recent
update
View
thumb
title
11
click to vote
FOCS
1999
IEEE
113
views
Theoretical Computer Science
»
more
FOCS 1999
»
An Approximate L1-Difference Algorithm for Massive Data Streams
13 years 9 months ago
Download
cs-www.cs.yale.edu
Joan Feigenbaum, Sampath Kannan, Martin Strauss, M...
claim paper
Read More »
11
click to vote
FOCS
1999
IEEE
95
views
Theoretical Computer Science
»
more
FOCS 1999
»
Bounds for Small-Error and Zero-Error Quantum Algorithms
13 years 9 months ago
Download
homepages.cwi.nl
Harry Buhrman, Richard Cleve, Ronald de Wolf, Chri...
claim paper
Read More »
6
click to vote
FOCS
1999
IEEE
73
views
Theoretical Computer Science
»
more
FOCS 1999
»
Magic Functions
13 years 9 months ago
Download
www.freedomscientific.com
Cynthia Dwork, Moni Naor, Omer Reingold, Larry J. ...
claim paper
Read More »
10
click to vote
FOCS
1999
IEEE
94
views
Theoretical Computer Science
»
more
FOCS 1999
»
How Asymmetry Helps Load Balancing
13 years 9 months ago
Download
www.cc.gatech.edu
This paper deals with balls and bins processes related to randomized load balancing, dynamic resource allocation, and hashing. Suppose
Berthold Vöcking
claim paper
Read More »
16
click to vote
FOCS
1999
IEEE
80
views
Theoretical Computer Science
»
more
FOCS 1999
»
A Sublinear Time Approximation Scheme for Clustering in Metric Spaces
13 years 9 months ago
Download
reference.kfupm.edu.sa
The metric 2-clustering problem is de ned as follows: given a metric (X;d), partition X into two sets S1 and S2 in order to minimize the value of X i X fu;vg Si d(u;v) In this pap...
Piotr Indyk
claim paper
Read More »
« Prev
« First
page 3 / 8
Last »
Next »