Konstantinos Kalpakis Papers on DiSC'02 Distance Measures for Effective Clustering of ARIMA Time-Series Publications Note: Links lead to the DBLP on the Web. Konstantinos Kalpakis 9 Konstantinos Kalpakis, Dhiral Gada , Vasundhara Puttagunta : Distance Measures for Effective Clustering of ARIMA Time-Series. ICDM 2001 : 273-280 8 Konstantinos Kalpakis, Koustuv Dasgupta , Ouri Wolfson : Steiner-Optimal Data Replication in Tree Networks with Storage Costs. IDEAS 2001 : 285-293 7 Konstantinos Kalpakis, Koustuv Dasgupta , Ouri Wolfson : Optimal Placement of Replicas in Trees with Read, Write, and Storage Costs. IEEE Transactions on Parallel and Distributed Systems 12 (6): 628-637 (2001) 6 Bella Belegradek , Konstantinos Kalpakis, Yelena Yesha : Strategies for maximizing seller's profit under unknown buyer's valuations. Information Sciences 124 (1-4): 219-239 (2000) 5 Konstantinos Kalpakis, Yaacov Yesha : Upper and Lower Bounds on the Makespan of Schedules for Tree Dags on Linear Arrays. Algorithmica 23 (2): 159-179 (1999) 4 Bella Belegradek , Konstantinos Kalpakis, Yelena Yesha : Maximizing Seller's Profit for Electronic Commerce. Trends in Distributed Systems for Electronic Commerce 1998 : 26-38 3 Konstantinos Kalpakis, Y. Yesha : Scheduling Tree DAGs on Parallel Architectures. Algorithmica 15 (4): 373-396 (1996) 2 Konstantinos Kalpakis, Yaacov Yesha : On the Power of the Linear Array Architecture for Performing Tree-Structured Computations. JCSS 50 (1): 1-10 (1995) 1 Daniel A. Menascé , Yelena Yesha , Konstantinos Kalpakis: On a Unified Framework for the Evaluation of Distributed Quorum Attainment Protocols. TSE 20 (11): 868-884 (1994) DiSC'02 © 2003 Association for Computing Machinery