Welcome to D
SIGMOD 2003
PODS 2003
SIGMOD-RECOR
ADBIS
CIDR 2003
CIKM 2003
DASFAA 2003
Data Enginee
DEBS
DMKD 2003
DOLAP 2003
DPDJ 2003
ER
GIS 2003
Hypertext 20
ICDE 2003
ICDM 2003
ICDT 2003
JCDL 2003
KRDB 2003
MIR 2003
MIS 2003
MMDB 2003
RIDE 2003
SBBD 2003
SIGIR 2003
SIGIR-FORUM
SIGKDD 2003
SIGKDD-EXP
SSDBM 2003
TIME 2003
TODS
VLDB 2003
VLDB Journal
WIDM 2003
About DiSC 2
Editorial Bo
Acknowledgem
DiSC 2004 Pr
ADVIS
DiSC'04 Feed
DiSC'04 Site
Search DiSC'
<<<Author Index>>>
Copyright No

Liadan O'Callaghan

Papers on DiSC'04


Maintaining variance and k-medians over data stream windows

Publications


Note: Links lead to the DBLP on the Web.

Liadan O'Callaghan

Brian Babcock , Mayur Datar , Rajeev Motwani , Liadan O'Callaghan: Maintaining variance and k-medians over data stream windows. PODS 2003 : 234-243

Tomás Feder , Adam Meyerson , Rajeev Motwani , Liadan O'Callaghan, Rina Panigrahy : Representing Graph Metrics with Fewest Edges. STACS 2003 : 355-366

Tomás Feder , Rajeev Motwani , Liadan O'Callaghan, Chris Olston , Rina Panigrahy : Computing Shortest Paths with Uncertainty. STACS 2003 : 367-378

Moses Charikar , Liadan O'Callaghan, Rina Panigrahy : Better streaming algorithms for clustering problems. STOC 2003 : 30-39

Sudipto Guha , Adam Meyerson , Nina Mishra , Rajeev Motwani , Liadan O'Callaghan: Clustering Data Streams: Theory and Practice. IEEE Trans. Knowl. Data Eng. 15 (3): 515-528 (2003)

Liadan O'Callaghan, Adam Meyerson , Rajeev Motwani , Nina Mishra , Sudipto Guha : Streaming-Data Algorithms for High-Quality Clustering. ICDE 2002 : 685-

Daniel J. Lehmann , Liadan O'Callaghan, Yoav Shoham : Truth revelation in approximately efficient combinatorial auctions. J. ACM 49 (5): 577-602 (2002)

Sudipto Guha , Nina Mishra , Rajeev Motwani , Liadan O'Callaghan: Clustering Data Streams. FOCS 2000 : 359-366

Daniel J. Lehmann , Liadan O'Callaghan, Yoav Shoham : Truth revelation in approximately efficient combinatorial auctions. ACM Conference on Electronic Commerce 1999 : 96-102

1 [ 9 ]

2 [ 6 ]

3 [ 9 ]

4 [ 7 ] [ 8 ]

5 [ 2 ] [ 4 ] [ 5 ]

6 [ 1 ] [ 3 ]

7 [ 4 ] [ 5 ] [ 8 ]

8 [ 2 ] [ 4 ] [ 5 ]

9 [ 2 ] [ 4 ] [ 5 ] [ 7 ] [ 8 ] [ 9 ]

10 [ 7 ]

11 [ 6 ] [ 7 ] [ 8 ]

12 [ 1 ] [ 3 ]




©2004 Association for Computing Machinery