MetaCart Sign in to MyCiteSeerX

Include Citations | Advanced Search | Help

Disambiguated Search | Include Citations | Advanced Search | Help

Searching for authors named "Alexandros Nanopoulos" – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency
Try your query at: Scholar | Yahoo! | Ask | Bing | CSB
Help! 22 documents found, showing 1 through 10. Next 10 →
ATOM RSS
  • C 2 P: Clustering based on Closest Pairs  
  • by Alexandros Nanopoulos, Aristotle Univ — 2001 — Proc. Int. Conference on Very Large Databases (VLDB’01
  • …In this paper we present C 2 P, a new clustering algorithm for large spatial databases, which exploits spatial access methods for the determination of closest pairs. Several extensions are presented for scalable clustering in large databases that contain clusters of various shapes and outliers. Due …
  • Cited by 10 (4 self) – Add To MetaCart
  • Indexing time-series databases for inverse queries  
  • by Alexandros Nanopoulos, Yannis Manolopoulos — 1998 — In Proceedings of the 9th International Conference on Database and Expert Systems Applications
  • …Abstract. In this paper we examine the problem of indexing time sequences in order to answer inverse queries. An inverse query computes all the time points at which the sequence contains values equal to the query value. The presented method is based on [7] in order to represent each time sequence wi…
  • Cited by 4 (0 self) – Add To MetaCart
  • Mining Patterns from Graph Traversals  
  • by Alexandros Nanopoulos, Yannis Manolopoulos — 2001 — Data and Knowledge Engineering
  • …In data models that have graph representations, users navigate following the links of the graph structure. Conducting data mining on collected information about user accesses in such models, involves the determination of frequently occurring access sequences. In this paper, we examine the problem of…
  • Cited by 18 (3 self) – Add To MetaCart
  • An Efficient and Effective Algorithm for Density Biased Sampling  
  • by Alexandros Nanopoulos, Yannis Theodoridis, Yannis Manolopoulos
  • …In this paper we descr( e a new density-biased sampling algor (/(% It exploits spatial indexes and the local density infor7C6BH theypryCU( e, to pr vide impr ved quality of samplingr esult and fast access to elements of the dataset. It attains impr ved sampling quality, with rth ect to factor like …
  • Cited by 3 (0 self) – Add To MetaCart
  • Exploiting Web Log Mining for Web Cache Enhancement  
  • by Alexandros Nanopoulos, Dimitrios Katsaros, Yannis Manolopoulos — 2002 — in WEBKDD ’01: Revised Papers from the Third International Workshop on Mining Web Log Data Across All Customers Touch Points
  • …Improving the performance of the Web is a crucial requirement, since its popularity resulted in a large increase in the user perceived latency. In this paper, we describe a Web caching scheme that capitalizes on prefetching. Prefetching refers to the mechanism of deducing forthcoming page access…
  • Cited by 4 (0 self) – Add To MetaCart
  • Memory-Adative Association Rules Mining  
  • by Alexandros Nanopoulos, Ros Nanopoulos, Yannis Manolopoulos — 2004 — Inf. Syst
  • …New application areas resulted in an increase of the diversity of the workloads that Data Base ManagementSanage have to confront. Resource management for mixed workloads is attained with the prioritization of their tasks, which duringtheir execution may be forced to release some of their resources…
  • Cited by 1 (1 self) – Add To MetaCart
  • Categorical Range Queries in Large Databases  
  • by Alexandros Nanopoulos, Ros Nanopoulos, Panayiotis Bozanis — 2003 — In SSTD’03, LNCS 2750
  • …In this pape r e int r duce the categor214 (a.k.a. chr omatic) r) ge quer2L (CRQs) in the context oflar1P disk-r esident data sets, motivated by the fact that CRQsar conceptually simple and emer4 often in DBMSs. On the basis of spatial data str uctur3N and R-tr4L in par ticular e p r pose a multi-tr…
  • Cited by 1 (0 self) – Add To MetaCart
  • LR-tree: a Logarithmic Decomposable Spatial Index Method  
  • by Panayiotis Bozanis, Alexandros Nanopoulos, Yannis Manolopoulos — 2003
  • …this paper, we present LR-trees, a new efficient scheme for dynamic manipulation of large datasets, which combines the search performance of the bulkloaded R-trees with the updated performance of R # -trees. Experimental results provide evidence on the latter statement and illustrate the superior…
  • Cited by 2 (1 self) – Add To MetaCart
  • A Data Mining Algorithm for Generalized Web Prefetching  
  • by Alexandros Nanopoulos, Dimitrios Katsaros, Yannis Manolopoulos — 2003 — IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING
  • …Predictive Web prefetching refers to the mechanism of deducing the forthcoming page accesses of a client based on its past accesses. In this paper, we present a new context for the interpretation of Web prefetching algorithms as Markov predictors. We identify the factors that affect the performanc…
  • Cited by 39 (15 self) – Add To MetaCart
  • Effective Prediction of Web-user Accesses: A Data Mining Approach  
  • by Alexandros Nanopoulos, Dimitris Katsaros, Yannis Manolopoulos — 2001
  • …The problem of predicting web-user accesses has recently attracted significant attention. Several algorithms have been proposed, which find important applications, like user profiling, recommender systems, web prefetching, design of adaptive web sites, etc. In all these applications the core issue i…
  • Cited by 9 (1 self) – Add To MetaCart
Help! Showing 1 through 10. Next 10 →
ATOM RSS
Try your query at: Scholar | Yahoo! | Ask | Bing | CSB