The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Liadan O''Callaghan" ( http://dblp.L3S.de/Authors/Liadan_O''Callaghan )

  Author page on DBLP  Author page in RDF  Community of Liadan O'Callaghan in ASPL-2

Publication years (Num. hits)
1999-2007 (13)
Publication types (Num. hits)
article(6) inproceedings(7)
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
1Renato 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. Search on Bibsonomy ACM Transactions on Algorithms The full citation details ... 2007 DBLP  DOI  BibTeX  RDF online algorithms, Competitive analysis
1Tomás Feder, Rajeev Motwani, Liadan O'Callaghan, Chris Olston, Rina Panigrahy Computing shortest paths with uncertainty. Search on Bibsonomy J. Algorithms The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Adam Meyerson, Liadan O'Callaghan, Serge A. Plotkin A k-Median Algorithm with Running Time Independent of Data Size. Search on Bibsonomy Machine Learning The full citation details ... 2004 DBLP  DOI  BibTeX  RDF sublinear, clustering, sampling
1Sudipto Guha, Adam Meyerson, Nina Mishra, Rajeev Motwani, Liadan O'Callaghan Clustering Data Streams: Theory and Practice. Search on Bibsonomy IEEE Trans. Knowl. Data Eng. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF Clustering, approximation algorithms, data streams
1Tomás Feder, Adam Meyerson, Rajeev Motwani, Liadan O'Callaghan, Rina Panigrahy Representing Graph Metrics with Fewest Edges. Search on Bibsonomy STACS The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Tomás Feder, Rajeev Motwani, Liadan O'Callaghan, Chris Olston, Rina Panigrahy Computing Shortest Paths with Uncertainty. Search on Bibsonomy STACS The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Brian Babcock, Mayur Datar, Rajeev Motwani, Liadan O'Callaghan Maintaining variance and k-medians over data stream windows. Search on Bibsonomy PODS The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Moses Charikar, Liadan O'Callaghan, Rina Panigrahy Better streaming algorithms for clustering problems. Search on Bibsonomy STOC The full citation details ... 2003 DBLP  DOI  BibTeX  RDF clustering, streaming algorithm, k-median
1Daniel J. Lehmann, Liadan O'Callaghan, Yoav Shoham Truth revelation in approximately efficient combinatorial auctions. Search on Bibsonomy J. ACM The full citation details ... 2002 DBLP  DOI  BibTeX  RDF computational complexity, mechanism design, Combinatorial auctions
1Daniel J. Lehmann, Liadan O'Callaghan, Yoav Shoham Truth Revelation in Approximately Efficient Combinatorial Auctions Search on Bibsonomy CoRR The full citation details ... 2002 DBLP  BibTeX  RDF
1Liadan O'Callaghan, Adam Meyerson, Rajeev Motwani, Nina Mishra, Sudipto Guha Streaming-Data Algorithms for High-Quality Clustering. Search on Bibsonomy ICDE The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Sudipto Guha, Nina Mishra, Rajeev Motwani, Liadan O'Callaghan Clustering Data Streams. Search on Bibsonomy FOCS The full citation details ... 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
1Daniel J. Lehmann, Liadan O'Callaghan, Yoav Shoham Truth revelation in approximately efficient combinatorial auctions. Search on Bibsonomy ACM Conference on Electronic Commerce The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #13 of 13 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.