MetaCart Sign in to MyCiteSeerX

Include Citations | Advanced Search | Help

Disambiguated Search | Include Citations | Advanced Search | Help

Searching for authors named "Yannis Manolopoulos" – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency
Try your query at: Scholar | Yahoo! | Ask | Bing | CSB
Help! 93 documents found, showing 1 through 10. Next 10 →
ATOM RSS
  • Binomial Coefficient Computation: Recursion or Iteration  
  • by Yannis Manolopoulos
  • …Binomial coefficient computation, i.e. the calculation of the number of combinations of n objects taken k at a time, C(n,k), can be performed either by using recursion or by iteration. Here, we elaborate on a previous report [6], which presented recursive methods on binomial coefficient calculation …
  • Add To MetaCart
  • Closest Pair Queries in Spatial Databases  
  • by Yannis Manolopoulos — 2000 — In Proceedings of the ACM-SIGMOD Conference on Management of Data
  • …This paper addresses the problem of finding the K closest pairs between two spatial data sets, where each set is stored in a structure belonging in the R-tree family. Five different algorithms (four recursive and one iterative) are presented for solving this problem. The case of 1 closest pair is tr…
  • Cited by 39 (7 self) – Add To MetaCart
  • LDT: a Logarithmic Distributed Search  
  • by Panayiotis Bozanis, Yannis Manolopoulos — 2002
  • …We propose LDT, a new Scalable Distributed Search Tree for the dictionary problem, as an alternative to both random trees and deterministic height balanced trees. Our scheme exhibits logarithmic update time, either constant or logarithmic search time for single key queries and output sensitive query…
  • Add To MetaCart
  • Structure-Based Similarity Search with Graph Histograms  
  • by Apostolos Papadopoulos, Yannis Manolopoulos — 1999 — In Proceedings of the 10th International Workshop on Database & Expert Systems Applications
  • …Objects like road networks, CAD/CAM components, electrical or electronic circuits, molecules, can be represented as graphs, in many modern applications. In this paper, we propose an efficient and effective graph manipulation technique that can be used in graph-based similarity search. Given a query …
  • Cited by 13 (0 self) – Add To MetaCart
  • External Balanced Regular (x-BR) Trees: New Structures for Very Large Spatial Databases  
  • by Michael Vassilakopoulos, Yannis Manolopoulos, M. Vassilakopoulos, Y. Manolopoulos, Y. Manolopoulos — 1999 — Proceeding of the 7th Panhellenic Conference on Informatics, pp.III.61-III.68, Ioannina
  • …The External Balanced Regular (x-BR) Trees constitute a family of new secondary memory structures which are suitable for storing and indexing multi-dimensional points and line segments. In 2 dimensions, the resulting structure is an External Balanced Quadtree, in 3 dimensions an External Balances Oc…
  • Cited by 2 (1 self) – Add To MetaCart
  • Finding Generalized Path Patterns for Web Log Data Mining  
  • by Alex Nanopoulos, Yannis Manolopoulos — 2000
  • …Conducting data mining on logs of web servers involves the determination of frequently occurring access sequences. We examine the problem of finding traversal patterns from web logs by considering the fact that irrelevant accesses to web documents may be interleaved within access patterns due to nav…
  • Cited by 18 (6 self) – Add To MetaCart
  • DSL: Accommodating Skip Lists in the SDDS Model  
  • by Panayiotis Bozanis, Yannis Manolopoulos — 2000 — Carleton Scientific
  • …We propose DSL, a new Scalable Distributed Data Structure for the dictionary problem, based on a version of Skip Lists, as an alternative to both random trees and deterministic height balanced trees. Our scheme exhibits, with high probability, logarithmic search time, constant reconstruction time…
  • Cited by 1 (1 self) – Add To MetaCart
  • Broadcast program generation for Webcasting  
  • by Dimitrios Katsaros, Yannis Manolopoulos — 2004
  • …The advances in computer and communication technologies have made possible an ubiquitous computing environment were clients equipped with portable devices can send and receive data anytime and from anyplace. In such an asymmetric communication environment, data push has emerged as a very e#ective an…
  • Cited by 2 (1 self) – Add To MetaCart
  • Parallel Bulk-Loading of Spatial Data  
  • by Apostolos Papadopoulos , Yannis Manolopoulos — 2003 — PARALLEL COMPUTING
  • …Spatial database systems have been introduced in order to support non-traditional data types and more complex queries. Although bulk-loading techniques for access methods have been studied in the spatial database literature, parallel bulk-loading has not been addressed in a parallel spatial database…
  • Cited by 1 (0 self) – Add To MetaCart
  • A Suffix Tree Based Prediction Scheme for Pervasive Computing Environments  
  • by Dimitrios Katsaros, Yannis Manolopoulos — 2005 — In Lecture notes in computer science (LNCS
  • …Discrete sequence modeling and prediction is a fundamental goal and a challenge for location-aware computing. Mobile client's data request forecasting and location tracking in wireless cellular networks are characteristic application areas of sequence prediction in pervasive computing, where lea…
  • 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