default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKonstantinos Kalpakis
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j19]Konstantinos Kalpakis
:
Consensus-relevance kNN and covariate shift mitigation. Mach. Learn. 113(1): 325-353 (2024)
2010 – 2019
- 2019
- [j18]Ankur Padia, Konstantinos Kalpakis, Francis Ferraro, Tim Finin:
Knowledge graph fact prediction via knowledge-enriched tensor factorization. J. Web Semant. 59 (2019) - [c21]Ankur Padia, Konstantinos Kalpakis, Francis Ferraro, Tim Finin:
Reflections on: Knowledge Graph Fact Prediction via Knowledge-Enriched Tensor Factorization. JT@ISWC 2019 - [i2]Ankur Padia, Konstantinos Kalpakis, Francis Ferraro, Tim Finin:
Knowledge Graph Fact Prediction via Knowledge-Enriched Tensor Factorization. CoRR abs/1902.03077 (2019) - 2016
- [c20]Ankur Padia, Konstantinos Kalpakis, Tim Finin:
Inferring relations in knowledge graphs with tensor decompositions. IEEE BigData 2016: 4020-4022 - 2015
- [j17]Konstantinos Kalpakis, Shiming Yang, Peter Fu-Ming Hu, Colin F. Mackenzie, Lynn G. Stansbury, Deborah M. Stein, Thomas M. Scalea:
Permutation entropy analysis of vital signs data for outcome prediction of patients with severe traumatic brain injury. Comput. Biol. Medicine 56: 167-174 (2015) - [c19]Kaavya Srinivasan, Konstantinos Kalpakis:
Intelligent Bus Stop Identification Using Smartphone Sensors. ICMLA 2015: 954-959 - 2014
- [j16]Shiming Yang, Konstantinos Kalpakis, Alain Biem:
Detecting Road Traffic Events by Coupling Multiple Timeseries With a Nonparametric Bayesian Method. IEEE Trans. Intell. Transp. Syst. 15(5): 1936-1946 (2014) - [i1]Dhananjay S. Phatak, Qiang Tang, Alan T. Sherman, Warren D. Smith, Peter Y. A. Ryan, Konstantinos Kalpakis:
DoubleMod and SingleMod: Simple Randomized Secret-Key Encryption with Bounded Homomorphicity. IACR Cryptol. ePrint Arch. 2014: 670 (2014) - 2013
- [c18]Jacob Thompson, Konstantinos Kalpakis:
Distributed model consensus for models of locally biased measurements in wireless sensor networks. ICNC 2013: 18-22 - [c17]Shiming Yang, Konstantinos Kalpakis, Alain Biem:
Spatio-temporal coupled Bayesian Robust Principal Component Analysis for road traffic event detection. ITSC 2013: 392-398 - 2012
- [c16]Shiming Yang, Konstantinos Kalpakis, Alain Biem:
An adaptive observation site selection strategy for road traffic data assimilation. CTS@SIGSPATIAL 2012: 2-7 - [c15]Shiming Yang, Konstantinos Kalpakis, Colin F. Mackenzie, Lynn G. Stansbury, Deborah M. Stein, Thomas M. Scalea, Peter Fu-Ming Hu:
Online Recovery of Missing Values in Vital Signs Data Streams Using Low-Rank Matrix Completion. ICMLA (1) 2012: 281-287 - [c14]Konstantinos Kalpakis, Shiming Yang, Peter Fu-Ming Hu, Colin F. Mackenzie, Lynn G. Stansbury, Deborah M. Stein, Thomas M. Scalea:
Outcome Prediction for Patients with Severe Traumatic Brain Injury Using Permutation Entropy Analysis of Electronic Vital Signs Data. MLDM 2012: 415-426 - 2011
- [j15]Wei Xiong, Chein-I Chang, Chao-Cheng Wu, Konstantinos Kalpakis, Hsian-Min Chen:
Fast Algorithms to Implement N-FINDR for Hyperspectral Endmember Extraction. IEEE J. Sel. Top. Appl. Earth Obs. Remote. Sens. 4(3): 545-564 (2011) - [c13]Shantanu Fauji, Konstantinos Kalpakis:
A gossip-based energy efficient protocol for robust in-network aggregation in wireless sensor networks. PerCom Workshops 2011: 166-171 - 2010
- [j14]Konstantinos Kalpakis, Shilang Tang:
Maximum lifetime continuous query processing in wireless sensor networks. Ad Hoc Networks 8(7): 723-741 (2010) - [j13]Konstantinos Kalpakis:
Everywhere sparse approximately optimal minimum energy data gathering and aggregation in sensor networks. ACM Trans. Sens. Networks 7(1): 9:1-9:26 (2010)
2000 – 2009
- 2009
- [j12]Konstantinos Kalpakis, Shilang Tang:
A combinatorial algorithm for the maximum lifetime data gathering with aggregation problem in sensor networks. Comput. Commun. 32(15): 1655-1665 (2009) - 2008
- [j11]Konstantinos Kalpakis, Shilang Tang:
Collaborative data gathering in wireless sensor networks using measurement co-occurrence. Comput. Commun. 31(10): 1979-1992 (2008) - [c12]Konstantinos Kalpakis, Shilang Tang:
A combinatorial algorithm for the Maximum Lifetime Data Gathering And Aggregation problem in sensor networks. WOWMOM 2008: 1-8 - 2007
- [j10]Vasundhara Puttagunta, Konstantinos Kalpakis:
Accuracy vs. Lifetime: Linear Sketches for Aggregate Queries in Sensor Networks. Algorithmica 49(4): 357-385 (2007) - 2006
- [c11]Konstantinos Kalpakis, Shilang Tang:
Trading Computation & Precision for Energy inWireless Sensor Networks with Applications. ICPP Workshops 2006: 196-206 - 2005
- [c10]Konstantinos Kalpakis, Parag Namjoshi:
Haplotype Phasing Using Semidefinite Programming. BIBE 2005: 145-152 - [c9]Vasundhara Puttagunta, Konstantinos Kalpakis:
Adaptive Clusters and Histograms over Data Streams. IKE 2005: 98-104 - 2004
- [c8]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
- [j9]Konstantinos Kalpakis, Koustuv Dasgupta, Parag Namjoshi:
Efficient algorithms for maximum lifetime data gathering and aggregation in wireless sensor networks. Comput. Networks 42(6): 697-716 (2003) - [c7]Koustuv Dasgupta, Meghna Kukreja, Konstantinos Kalpakis:
Topology-Aware Placement and Role Assignment for Energy-Efficient Information Gathering in Sensor Networks. ISCC 2003: 341-348 - [c6]Koustuv Dasgupta, Konstantinos Kalpakis, Parag Namjoshi:
An efficient clustering-based heuristic for data gathering and aggregation in sensor networks. WCNC 2003: 1948-1953 - 2002
- [c5]Vasundhara Puttagunta, Konstantinos Kalpakis:
Adaptive Methods for Activity Monitoring of Streaming Data. ICMLA 2002: 197-203 - 2001
- [j8]Konstantinos Kalpakis, Koustuv Dasgupta, Ouri Wolfson:
Optimal Placement of Replicas in Trees with Read, Write, and Storage Costs. IEEE Trans. Parallel Distributed Syst. 12(6): 628-637 (2001) - [c4]Konstantinos Kalpakis, Dhiral Gada, Vasundhara Puttagunta:
Distance Measures for Effective Clustering of ARIMA Time-Series. ICDM 2001: 273-280 - [c3]Konstantinos Kalpakis, Koustuv Dasgupta, Ouri Wolfson:
Steiner-Optimal Data Replication in Tree Networks with Storage Costs. IDEAS 2001: 285-293 - [c2]Ouri Wolfson, Sam Chamberlain, Konstantinos Kalpakis, Yelena Yesha:
Modeling Moving Objects for Location Based Services. Infrastructure for Mobile and Wireless Systems 2001: 46-58 - 2000
- [j7]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)
1990 – 1999
- 1999
- [j6]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
- [c1]Bella Belegradek, Konstantinos Kalpakis, Yelena Yesha:
Maximizing Seller's Profit for Electronic Commerce. Trends in Distributed Systems for Electronic Commerce 1998: 26-38 - 1997
- [j5]Konstantinos Kalpakis, Yaacov Yesha:
On the bisection width of the transposition network. Networks 29(1): 69-76 (1997) - 1996
- [j4]Konstantinos Kalpakis, Yelena Yesha:
Scheduling Tree DAGs on Parallel Architectures. Algorithmica 15(4): 373-396 (1996) - 1995
- [j3]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
- [j2]Konstantinos Kalpakis, Alan T. Sherman:
Probabilistic analysis of an enhanced partitioning algorithm for the steiner tree problem in Rd. Networks 24(3): 147-159 (1994) - [j1]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)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:54 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
