( en | de | ru )

 

Disambiguation of "O'Callaghan, Liadan"

Author of the publication

copydeleteadd this publication to your clipboard
Representing Graph Metrics with Fewest Edges.

, , , , and . STACS, volume 2607 of Lecture Notes in Computer Science, page 355-366. Springer, (2003)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Patricia O'Callaghan

Michael O'Callaghan

Patrick O'Callaghan

 

Other publications of authors with the same name

Better streaming algorithms for clustering problems., , and . STOC, page 30-39. ACM, (2003)Asymptotic Polynomial-Time Approximation Schemes., , and . Handbook of Approximation Algorithms and Metaheuristics, Chapman and Hall/CRC, (2007)Truth revelation in approximately efficient combinatorial auctions., , and . EC, page 96-102. ACM, (1999)Truth Revelation in Approximately Efficient Combinatorial Auctions, , and . CoRR, (2002)A k-Median Algorithm with Running Time Independent of Data Size., , and . Mach. Learn., 56 (1-3): 61-87 (2004)Representing Graph Metrics with Fewest Edges., , , , and . STACS, volume 2607 of Lecture Notes in Computer Science, page 355-366. Springer, (2003)Sampling from a moving window over streaming data, , , and . Proceedings of PODS'03, page 234--243. (2003)Streaming-Data Algorithms for High-Quality Clustering., , , , and . ICDE, page 685-694. IEEE Computer Society, (2002)Querying priced information in databases: The conjunctive case., , , , , , , and . ACM Trans. Algorithms, 3 (1): 9:1-9:22 (2007)Maintaining variance and k-medians over data stream windows., , , and . PODS, page 234-243. ACM, (2003)