According to our database1, Konstantinos Kalpakis authored at least 37 papers between 1994 and 2016.
Legend:Book In proceedings Article PhD thesis Other
Inferring relations in knowledge graphs with tensor decompositions.
Proceedings of the 2016 IEEE International Conference on Big Data, 2016
Permutation entropy analysis of vital signs data for outcome prediction of patients with severe traumatic brain injury.
Comp. in Bio. and Med., 2015
Intelligent Bus Stop Identification Using Smartphone Sensors.
Proceedings of the 14th IEEE International Conference on Machine Learning and Applications, 2015
Detecting Road Traffic Events by Coupling Multiple Timeseries With a Nonparametric Bayesian Method.
IEEE Trans. Intelligent Transportation Systems, 2014
DoubleMod and SingleMod: Simple Randomized Secret-Key Encryption with Bounded Homomorphicity.
IACR Cryptology ePrint Archive, 2014
Spatio-temporal coupled Bayesian Robust Principal Component Analysis for road traffic event detection.
Proceedings of the 16th International IEEE Conference on Intelligent Transportation Systems, 2013
Distributed model consensus for models of locally biased measurements in wireless sensor networks.
Proceedings of the International Conference on Computing, Networking and Communications, 2013
Outcome Prediction for Patients with Severe Traumatic Brain Injury Using Permutation Entropy Analysis of Electronic Vital Signs Data.
Proceedings of the Machine Learning and Data Mining in Pattern Recognition, 2012
Online Recovery of Missing Values in Vital Signs Data Streams Using Low-Rank Matrix Completion.
Proceedings of the 11th International Conference on Machine Learning and Applications, 2012
An adaptive observation site selection strategy for road traffic data assimilation.
Proceedings of the 5th ACM SIGSPATIAL International Workshop on Computational Transportation Science 2011, 2012
A gossip-based energy efficient protocol for robust in-network aggregation in wireless sensor networks.
Proceedings of the Ninth Annual IEEE International Conference on Pervasive Computing and Communications, 2011
Everywhere sparse approximately optimal minimum energy data gathering and aggregation in sensor networks.
Maximum lifetime continuous query processing in wireless sensor networks.
Ad Hoc Networks, 2010
A combinatorial algorithm for the maximum lifetime data gathering with aggregation problem in sensor networks.
Computer Communications, 2009
Collaborative data gathering in wireless sensor networks using measurement co-occurrence.
Computer Communications, 2008
A combinatorial algorithm for the Maximum Lifetime Data Gathering And Aggregation problem in sensor networks.
Proceedings of the 9th IEEE International Symposium on a World of Wireless, 2008
Accuracy vs. Lifetime: Linear Sketches for Aggregate Queries in Sensor Networks.
Trading Computation & Precision for Energy inWireless Sensor Networks with Applications.
Proceedings of the 2006 International Conference on Parallel Processing Workshops (ICPP Workshops 2006), 2006
Adaptive Clusters and Histograms over Data Streams.
Proceedings of The 2005 International Conference on Information and Knowledge Engineering, 2005
Haplotype Phasing Using Semidefinite Programming.
Proceedings of the Fifth IEEE International Symposium on Bioinformatic and Bioengineering (BIBE 2005), 2005
Accuracy vs. lifetime: linear sketches for approximate aggregate range queries in sensor networks.
Proceedings of the DIALM-POMC Joint Workshop on Foundations of Mobile Computing, 2004
Efficient algorithms for maximum lifetime data gathering and aggregation in wireless sensor networks.
Computer Networks, 2003
An efficient clustering-based heuristic for data gathering and aggregation in sensor networks.
Proceedings of the 2003 IEEE Wireless Communications and Networking, 2003
Topology-Aware Placement and Role Assignment for Energy-Efficient Information Gathering in Sensor Networks.
Proceedings of the Eighth IEEE Symposium on Computers and Communications (ISCC 2003), 30 June, 2003
Adaptive Methods for Activity Monitoring of Streaming Data.
Proceedings of the 2002 International Conference on Machine Learning and Applications, 2002
Optimal Placement of Replicas in Trees with Read, Write, and Storage Costs.
IEEE Trans. Parallel Distrib. Syst., 2001
Modeling Moving Objects for Location Based Services.
Proceedings of the Developing an Infrastructure for Mobile and Wireless Systems, 2001
Steiner-Optimal Data Replication in Tree Networks with Storage Costs.
Proceedings of the International Database Engineering & Applications Symposium, 2001
Distance Measures for Effective Clustering of ARIMA Time-Series.
Proceedings of the 2001 IEEE International Conference on Data Mining, 29 November, 2001
Strategies for maximizing seller's profit under unknown buyer's valuations.
Inf. Sci., 2000
Upper and Lower Bounds on the Makespan of Schedules for Tree Dags on Linear Arrays.
Maximizing Seller's Profit for Electronic Commerce.
Proceedings of the Trends in Distributed Systems for Electronic Commerce, 1998
On the bisection width of the transposition network.
Scheduling Tree DAGs on Parallel Architectures.
On the Power of the Linear Array Architecture for Performing Tree-Structured Computations.
J. Comput. Syst. Sci., 1995
On a Unified Framework for the Evaluation of Distributed Quorum Attainment Protocols.
IEEE Trans. Software Eng., 1994
Probabilistic analysis of an enhanced partitioning algorithm for the steiner tree problem in Rd.