|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 20 occurrences of 17 keywords
|
|
|
|
|
Results
Found 13 publication records. Showing 13 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Renato Carmo, Tomás Feder, Yoshiharu Kohayakawa, Eduardo Sany Laber, Rajeev Motwani, Liadan O'Callaghan, Rina Panigrahy, Dilys Thomas |
Querying priced information in databases: The conjunctive case.  |
ACM Transactions on Algorithms  |
2007 |
DBLP DOI BibTeX RDF |
online algorithms, Competitive analysis |
| 1 | Tomás Feder, Rajeev Motwani, Liadan O'Callaghan, Chris Olston, Rina Panigrahy |
Computing shortest paths with uncertainty.  |
J. Algorithms  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Adam Meyerson, Liadan O'Callaghan, Serge A. Plotkin |
A k-Median Algorithm with Running Time Independent of Data Size.  |
Machine Learning  |
2004 |
DBLP DOI BibTeX RDF |
sublinear, clustering, sampling |
| 1 | Sudipto Guha, Adam Meyerson, Nina Mishra, Rajeev Motwani, Liadan O'Callaghan |
Clustering Data Streams: Theory and Practice.  |
IEEE Trans. Knowl. Data Eng.  |
2003 |
DBLP DOI BibTeX RDF |
Clustering, approximation algorithms, data streams |
| 1 | Tomás Feder, Adam Meyerson, Rajeev Motwani, Liadan O'Callaghan, Rina Panigrahy |
Representing Graph Metrics with Fewest Edges.  |
STACS  |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Tomás Feder, Rajeev Motwani, Liadan O'Callaghan, Chris Olston, Rina Panigrahy |
Computing Shortest Paths with Uncertainty.  |
STACS  |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Brian Babcock, Mayur Datar, Rajeev Motwani, Liadan O'Callaghan |
Maintaining variance and k-medians over data stream windows.  |
PODS  |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Moses Charikar, Liadan O'Callaghan, Rina Panigrahy |
Better streaming algorithms for clustering problems.  |
STOC  |
2003 |
DBLP DOI BibTeX RDF |
clustering, streaming algorithm, k-median |
| 1 | Daniel J. Lehmann, Liadan O'Callaghan, Yoav Shoham |
Truth revelation in approximately efficient combinatorial auctions.  |
J. ACM  |
2002 |
DBLP DOI BibTeX RDF |
computational complexity, mechanism design, Combinatorial auctions |
| 1 | Daniel J. Lehmann, Liadan O'Callaghan, Yoav Shoham |
Truth Revelation in Approximately Efficient Combinatorial Auctions  |
CoRR  |
2002 |
DBLP BibTeX RDF |
|
| 1 | Liadan O'Callaghan, Adam Meyerson, Rajeev Motwani, Nina Mishra, Sudipto Guha |
Streaming-Data Algorithms for High-Quality Clustering.  |
ICDE  |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Sudipto Guha, Nina Mishra, Rajeev Motwani, Liadan O'Callaghan |
Clustering Data Streams.  |
FOCS  |
2000 |
DBLP DOI BibTeX RDF |
data stream clustering, point sequence, data stream model, Web click stream analysis, multimedia data analysis, constant-factor approximation algorithms, computational complexity, data analysis, deterministic algorithms, deterministic algorithms, very large databases, massive data sets, pattern clustering, k-median problem |
| 1 | Daniel J. Lehmann, Liadan O'Callaghan, Yoav Shoham |
Truth revelation in approximately efficient combinatorial auctions.  |
ACM Conference on Electronic Commerce  |
1999 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #13 of 13 (100 per page; Change: )
|
|