Kostas's Home Page

Konstantinos Kalpakis, Ph.D.
Associate Professor
Computer Science and Electrical Engineering Department
University of Maryland Baltimore County

Items of Interest:

Research interests
Teaching
Advisement
Current Students
Selected publications
Selected Projects
Professional activities
Database resources
Other information
Contact Information

Advisement for Fall 2012

TuTh 1:15-2:15pm (available only to my assigned students), and
by appointment.

Teaching

Current Students

Graduate students

Ph.D. students
M.S. students

Undergraduate students

Research Interests

Currently, I am investigating issues in replication, software system architectures, indexing, query processing, mining, resource management, and scheduling for federated multimedia systems. The aim of my efforts is to design and implement distributed interoperable low-cost software systems that enable the efficient management and processing of multimedia data and distributed systems. The application domains I am focusing on are the Earth and Space science domains. Funding for my work is/was provided by NASA and NSF.

Selected Publications

The copyright for all papers in journals and conferences is owned by the publisher.

Konstantinos Kalpakis and Shilang Tang, "Maximum Lifetime Continuous Query Processing in Wireless Sensor Networks". Accepted for publication (February 2010). To appear in ADHOC NETWORKS.

Konstantinos Kalpakis, "Everywhere Sparse Approximately Optimal Minimum Energy Data Gathering and Aggregation in Sensor Networks". Accepted for publication (January 2010). To appear in ACM TRANSACTIONS ON SENSOR NETWORKS.

Konstantinos Kalpakis and Shilang Tang, "A Combinatorial Algorithm for the Maximum Lifetime Data Gathering with Aggregation Problem in Sensor Networks". COMPUTER COMMUNICATIONS, Volume 32 , Issue 15 , pp. 1655-1665, September 2009.

Konstantinos Kalpakis and Shilang Tang, "A Combinatorial Algorithm for the Maximum Lifetime Data Gathering with Aggregation Problem in Sensor Networks". In the Proceedings of the 9th IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks, (WOWMOM 2008), pp. 1-8, Newport Beach, CA, USA, June 23-26, 2008.

Konstantinos Kalpakis and Shilang Tang, "Collaborative data gathering in wireless sensor networks using measurement co-occurrence.". COMPUTER COMMUNICATIONS, Volume 31, Issue 10, pp. 1979-1992, 2008. Preminilary version in the Proceedings of the 2007 International Conference on Sensor Technologies and Applications (SENSORCOMM 2007), pp. 597-603. Valencia, Spain, October 14-20, 2007.

Vasundhara Puttagunta and Konstantinos Kalpakis "Accuracy Vs. Lifetime: Linear Sketches for Approximate Aggregate Range Queries in Sensor Networks.". ALGORITHMICA, Volume 49, Issue 4, pp. 357-385, 2007. Preliminary version available as UMBC CS TR-04-04, February 11, 2004.

Konstantinos Kalpakis and Shilang Tang, "Trading Computation & Precision for Energy in Wireless Sensor Networks with Applications.". In the Proceedings of the 2006 International Conference on Parallel Processing Workshops (ICPP 2006), pp. 196-206. Columbus, OH, August 14-18, 2006.

Konstantinos Kalpakis, Vasundhara Puttagunta, and Parag Namjoshi, "Accuracy vs. Lifetime: Linear Sketches for Approximate Aggregate Range Queries in Sensor Networks." In the Proceedings of the 2004 DIALM-POMC Joint Workshop on Foundations of Mobile Computing, pp. 67-74. Philadelphia, PA, October 1, 2004.

Vasundhara Puttagunta and Konstantinos Kalpakis, "Linear Sketches for Approximate Aggregate Range Queries". UMBC CS TR-03-29, December 1, 2003.

Koustuv Dasgupta, Meghna Kukreja, and Konstantinos Kalpakis "Topology--Aware Placement and Role Assignment for Energy-Efficient Information Gathering in Sensor Networks". In the Proceedings of the 8th IEEE Symposium on Computers and Communications, Kemer-Antalya, Turkey, June 30-July 3, 2003. Available as UMBC CS TR-02-18, November 27, 2002.

Koustuv Dasgupta, Konstantinos Kalpakis, and Parag Namjoshi, "Improving the Lifetime of Sensor Networks via Intelligent Selection of Data Aggregation Trees". In the Proceedings of the Communication Networks and Distributed Systems Modeling and Simulation Conference, Orlando, Florida, January 19-23, 2003. Also available as UMBC CS TR-02-16, October 16, 2002.

Konstantinos Kalpakis, Koustuv Dasgupta, and Parag Namjoshi, "Efficient algorithms for maximum lifetime data gathering and aggregation in wireless sensor networks". To appear in the Computer Networks Journal. Also available as UMBC CS TR-02-13, August 26, 2002.

Koustuv Dasgupta, Konstantinos Kalpakis, Parag Namjoshi "An Efficient Clustering--based Heuristic for Data Gathering and Aggregation in Sensor Networks". In the Proceedings of the IEEE Wireless Communications and Networking Conference (WCNC), New Orleans, Louisiana, USA, March 16-20, 2003.

Konstantinos Kalpakis, Koustuv Dasgupta, and Parag Namjoshi, "Maximum Lifetime Data Gathering and Aggregation in Wireless Sensor Networks". In the Proceedings of the 2002 IEEE International Conference on Networking (ICN'02), Atlanta, Georgia, August 26-29, 2002. pp. 685-696. An updated version is available as UMBC CS TR-02-12.

Konstantinos Kalpakis, Koustuv Dasgupta, and Shamit Patel, "Adaptive Resource Management for Scalable Network-Attached Storage Systems". In the Proceedings the 2002 International Symposium on Performance Evaluation of Computer and Telecommunication Systems (SPECTS'02), July 14-18, 2002, San Diego, CA. pp. 736-743.

Vasundhara Puttagunta and Konstantinos Kalpakis, "Adaptive Methods for Activity Monitoring of Streaming Data" In the Proceedings of the 2002 International Conferences on Machine Learning and Applications (ICMLA'02), Las Vegas, Nevada, June 24 - 27, 2002. pp. 197-203.

Konstantinos Kalpakis, Dhiral Gada, and Vasundhara Puttagunta, "Distance Measures for Effective Clustering of ARIMA Time-Series". In the Proceedings of the 2001 IEEE International Conference on Data Mining (ICDM'01), San Jose, CA, November 29-December 2, 2001, pp. 273-280.
The timeseries datasets used in the paper are available here.

Konstantinos Kalpakis, Koustuv Dasgupta, and Ouri Wolfson, "Optimal Placement of Replicas in Trees with Read, Write, and Storage Costs". IEEE Transactions on Parallel and Distributed Systems, Vol. 12, No. 6, pp. 628-637, June 2001.

Konstantinos Kalpakis, Koustuv Dasgupta, and Ouri Wolfson, "Steiner-Optimal Data Replication in Tree Networks with Storage Costs". UMBC CS TR-01-04. Also in the Proceedings of the International Database Engineering and Applications Symposium (IDEAS'01), pp. 285-293, Grenoble, France, July 16-18, 2001.

Konstantinos Kalpakis and Koustuv Dasgupta, "Data Replication on Networks with Bounded Treewidth". Submitted for publication. Also available as UMBC CS TR-01-03, February 2001.

Koustuv Dasgupta and Konstantinos Kalpakis, "Maintaining Replicated Redirection Services in Web-based Information Systems". UMBC CS TR-01-02. Also in the Proceedings of the 2nd IEEE Workshop on Internet Applications (WIAPP'01), pp. 143-152, San Jose, CA, July 23--24, 2001.

Bella Belegradek, Konstantinos Kalpakis, and Yelena Yesha, "Strategies for Maximizing Seller's Profit under Unknown Buyer's Valuations". Information Sciences, Vol. 124, No. 1-4, pp. 219-239. March 2000.

Konstantinos Kalpakis and Yaacov Yesha. "Upper and Lower Bounds on the Makespan of Schedules for Tree Dags on Linear Arrays". Algorithmica, Vol 23, No. 2, pp. 159-179, 1999.

Konstantinos Kalpakis and Yaacov Yesha. "On the Bisection Width of the Transposition Network". Networks, Vol. 29, No. 1, pp. 69-76, January 1997.

"Strategic Directions in Electronic Commerce and Digital Libraries: Towards a Digital Agora", ACM Computing Surveys, Vol. 28 (4), pp. 818-835, December 1996.

Konstantinos Kalpakis and Yaacov Yesha. "Scheduling Tree Dags on Parallel Architectures". Algorithmica, Vol. 15, No. 4, pp. 373-396, April 1996.

Konstantinos Kalpakis and Yaacov Yesha. "On the Power of the Linear Array Architecture for Performing Tree-Structured Computations". Journal of Computer and System Sciences, Vol. 50, No. 1, pp. 1-10, February 1995.

Daniel A. Menasce, Yelena Yesha, and Konstantinos Kalpakis. "On a Unified Framework for the Evaluation of Distributed Quorum Attainment Protocols". IEEE Transactions on Software Engineering, Vol. 20, No. 11, pp. 868-884, November 1994.

Konstantinos Kalpakis and Alan T. Sherman. "Probabilistic Analysis of an Enhanced Partitioning Algorithm for the Steiner Tree Problem in R^d", Networks, Vol. 24, No. 3, pp. 147-159, May 1994.

Selected Projects