MetaCart Sign in to MyCiteSeerX

Include Citations | Advanced Search | Help

Disambiguated Search | Include Citations | Advanced Search | Help

Searching for authors named "Konstantinos Kalpakis" – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency
Try your query at: Scholar | Yahoo! | Ask | Bing | CSB
Help! 15 documents found, showing 1 through 10. Next 10 →
ATOM RSS
  • Maintaining Replicated Redirection Services in Web-based Information Systems  
  • by Konstantinos Kalpakis, Koustuv Dasgupta, Koustuv Dasgupta, Konstantinos Kalpakis
  • …The growth in the commercial use of the Internet and the proliferation of new Web information services has led to a number of problems - overloaded servers, traffic congestion and increasing client latencies. Dynamic replication of information among geographically distributed Web servers is commo…
  • Add To MetaCart
  • Haplotype phasing using semidefinite programming  
  • by Konstantinos Kalpakis, Parag Namjoshi — 2005 — In BIBE
  • …Diploid organisms, such as humans, inherit one copy of each chromosome (haplotype) from each parent. The conflation of inherited haplotypes is called the genotype of the organism. In many disease association studies, the haplotype data is more informative than the genotype data. Unfortunately, getti…
  • Cited by 8 (0 self) – Add To MetaCart
  • Distance Measures for Effective Clustering of ARIMA Time-Series  
  • by Konstantinos Kalpakis Dhiral, Konstantinos Kalpakis, Dhiral Gada, Vasundhara Puttagunta — 2001 — In proceedings of the 2001 IEEE International Conference on Data Mining
  • …Many environmental and socioeconomic time--series data can be adequately modeled using Auto-Regressive Integrated Moving Average (ARIMA) models. We call such time--series ARIMA time--series. We consider the problem of clustering ARIMA time--series. We propose the use of the Linear Predictive Coding …
  • Add To MetaCart
  • Steiner-Optimal Data Replication in Tree Networks  
  • by Ouri Wolfson, Konstantinos Kalpakis, Konstantinos Kalpakis, Koustuv Dasgupta, Koustuv Dasgupta, Ouri Wolfson — 2001
  • …We consider the problem of placing copies of objects in a tree network in order to minimize the cost of servicing read and write requests to objects when the tree nodes have limited storage and the number of copies permitted is limited. The set of nodes that have a copy of the object, called repl…
  • Add To MetaCart
  • Accuracy vs Lifetime: Linear Sketches for Appoximate Aggregate Range Queries in Sensor Networks  
  • by Aggregate Range, Konstantinos Kalpakis, Konstantinos Kalpakis, Vasundhara Puttagunta, Vasundhara Puttagunta, Parag Namjoshi, Parag Namjoshi — 2004
  • …Query processing in sensor networks is critical for several sensor based monitoring applications and poses several challenging research problems. The in--network aggregation paradigm in sensor networks provides a versatile approach for evaluating simple aggregate queries, in which an aggregation--…
  • Cited by 3 (0 self) – Add To MetaCart
  • Improving the Lifetime of Sensor Networks via Intelligent Selection of Data Aggregation Trees  
  • by Koustuv Dasgupta, Konstantinos Kalpakis, Parag Namjoshi — 2003 — In: Proceedings of the Communication Networks and Distributed Systems Modeling and Simulation Conference
  • …We consider a network of energy-constrained sensors that are deployed over a region. Each sensor periodically produces information as it monitors its vicinity. The basic operation in such a network is the systematic gathering and transmission of sensed data to a base station for further processing…
  • Cited by 1 (0 self) – Add To MetaCart
Help! Showing 1 through 10. Next 10 →
ATOM RSS
Try your query at: Scholar | Yahoo! | Ask | Bing | CSB