| 2008 |
|---|
| 21 | EE | Konstantinos Kalpakis,
Shilang Tang:
A combinatorial algorithm for the Maximum Lifetime Data Gathering And Aggregation problem in sensor networks.
WOWMOM 2008: 1-8 |
| 20 | EE | Konstantinos Kalpakis,
Shilang Tang:
Collaborative data gathering in wireless sensor networks using measurement co-occurrence.
Computer Communications 31(10): 1979-1992 (2008) |
| 2007 |
|---|
| 19 | EE | Vasundhara Puttagunta,
Konstantinos Kalpakis:
Accuracy vs. Lifetime: Linear Sketches for Aggregate Queries in Sensor Networks.
Algorithmica 49(4): 357-385 (2007) |
| 2006 |
|---|
| 18 | EE | Konstantinos Kalpakis,
Shilang Tang:
Trading Computation & Precision for Energy inWireless Sensor Networks with Applications.
ICPP Workshops 2006: 196-206 |
| 2005 |
|---|
| 17 | EE | Konstantinos Kalpakis,
Parag Namjoshi:
Haplotype Phasing Using Semidefinite Programming.
BIBE 2005: 145-152 |
| 16 | | Vasundhara Puttagunta,
Konstantinos Kalpakis:
Adaptive Clusters and Histograms over Data Streams.
IKE 2005: 98-104 |
| 2004 |
|---|
| 15 | EE | Konstantinos Kalpakis,
Vasundhara Puttagunta,
Parag Namjoshi:
Accuracy vs. lifetime: linear sketches for approximate aggregate range queries in sensor networks.
DIALM-POMC 2004: 67-74 |
| 2003 |
|---|
| 14 | EE | Koustuv Dasgupta,
Meghna Kukreja,
Konstantinos Kalpakis:
Topology-Aware Placement and Role Assignment for Energy-Efficient Information Gathering in Sensor Networks.
ISCC 2003: 341-348 |
| 13 | EE | Konstantinos Kalpakis,
Koustuv Dasgupta,
Parag Namjoshi:
Efficient algorithms for maximum lifetime data gathering and aggregation in wireless sensor networks.
Computer Networks 42(6): 697-716 (2003) |
| 2002 |
|---|
| 12 | | Vasundhara Puttagunta,
Konstantinos Kalpakis:
Adaptive Methods for Activity Monitoring of Streaming Data.
ICMLA 2002: 197-203 |
| 2001 |
|---|
| 11 | EE | Konstantinos Kalpakis,
Dhiral Gada,
Vasundhara Puttagunta:
Distance Measures for Effective Clustering of ARIMA Time-Series.
ICDM 2001: 273-280 |
| 10 | | Konstantinos Kalpakis,
Koustuv Dasgupta,
Ouri Wolfson:
Steiner-Optimal Data Replication in Tree Networks with Storage Costs.
IDEAS 2001: 285-293 |
| 9 | EE | Ouri Wolfson,
Sam Chamberlain,
Konstantinos Kalpakis,
Yelena Yesha:
Modeling Moving Objects for Location Based Services.
Infrastructure for Mobile and Wireless Systems 2001: 46-58 |
| 8 | EE | Konstantinos Kalpakis,
Koustuv Dasgupta,
Ouri Wolfson:
Optimal Placement of Replicas in Trees with Read, Write, and Storage Costs.
IEEE Trans. Parallel Distrib. Syst. 12(6): 628-637 (2001) |
| 2000 |
|---|
| 7 | | Bella Belegradek,
Konstantinos Kalpakis,
Yelena Yesha:
Strategies for maximizing seller's profit under unknown buyer's valuations.
Inf. Sci. 124(1-4): 219-239 (2000) |
| 1999 |
|---|
| 6 | EE | 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) |
| 1998 |
|---|
| 5 | EE | Bella Belegradek,
Konstantinos Kalpakis,
Yelena Yesha:
Maximizing Seller's Profit for Electronic Commerce.
Trends in Distributed Systems for Electronic Commerce 1998: 26-38 |
| 1997 |
|---|
| 4 | EE | Konstantinos Kalpakis,
Yaacov Yesha:
On the bisection width of the transposition network.
Networks 29(1): 69-76 (1997) |
| 1996 |
|---|
| 3 | | Konstantinos Kalpakis,
Yelena Yesha:
Scheduling Tree DAGs on Parallel Architectures.
Algorithmica 15(4): 373-396 (1996) |
| 1995 |
|---|
| 2 | | Konstantinos Kalpakis,
Yaacov Yesha:
On the Power of the Linear Array Architecture for Performing Tree-Structured Computations.
J. Comput. Syst. Sci. 50(1): 1-10 (1995) |
| 1994 |
|---|
| 1 | EE | Daniel A. Menascé,
Yelena Yesha,
Konstantinos Kalpakis:
On a Unified Framework for the Evaluation of Distributed Quorum Attainment Protocols.
IEEE Trans. Software Eng. 20(11): 868-884 (1994) |
