#### Filter Results:

- Full text PDF available (9)

#### Publication Year

2007

2018

- This year (2)
- Last 5 years (8)
- Last 10 years (14)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- George Fikioris, Ioannis Psarros
- IEEE Transactions on Antennas and Propagation
- 2007

When one applies the method of auxiliary sources to scattering problems involving perfect conductors, one first seeks fictitious auxiliary currents located inside the conductor, and then determinesâ€¦ (More)

- George Fikioris, N L Tsitsas, Ioannis Psarros
- IEEE Transactions on Antennas and Propagation
- 2011

Using analytical methods, previous studies have shown that it is possible for oscillations to occur in the auxiliary surface current determined by applying the method of auxiliary sources (MAS) toâ€¦ (More)

- E. G. Papkelis, Ioannis Psarros, +5 authors P. Frangos
- IEEE Antennas and Propagation Magazine
- 2007

In this paper, a two-dimensional (2D) simulation method for the calculation of radio coverage in urban-area sites is presented, based on the analytical methods of physical optics (PO) and theâ€¦ (More)

- Evangelos Anagnostopoulos, Ioannis Z. Emiris, Ioannis Psarros
- Symposium on Computational Geometry
- 2015

The approximate nearest neighbor problem ( -ANN) in Euclidean settings is a fundamental question, which has been addressed by two main approaches: Data-dependent space partitioning techniques performâ€¦ (More)

Waiting time in bus stops heavily affects traveler attitude towards public transportation and therefore is an important element for consideration when planning and operating a bus system.â€¦ (More)

- George Fikioris, Ioannis Psarros
- 2009 International Conference on Electromagneticsâ€¦
- 2008

When applying the Method of Auxiliary Sources (MAS) one seeks to satisfy the boundary condition on N discrete points on a perfect electric conductor (PEC) by using N auxiliary sources located insideâ€¦ (More)

- Evangelos Anagnostopoulos, Ioannis Z. Emiris, Ioannis Psarros
- ACM Trans. Algorithms
- 2018

Approximate nearest neighbor search (Îµ-ANN) in high dimensions has been mainly addressed by Locality Sensitive Hashing (LSH), which has complexity with polynomial dependence in dimension, sublinearâ€¦ (More)

The construction of r-nets offers a powerful tool in computational and metric geometry. We focus on high-dimensional spaces and present a new randomized algorithm which efficiently computesâ€¦ (More)

- Ioannis Psarros, George Fikioris, M. Vlahoyianni
- IEEE Transactions on Antennas and Propagation
- 2009

The results obtained by modeling an infinite linear array of electrically short dipoles by an array of pseudopotentials (the pseudopotential is a quantum-mechanical analog of the dipole) can be usedâ€¦ (More)

- Ioannis Z. Emiris, Ioannis Psarros
- ArXiv
- 2014

A graph is called (generically) rigid in Rd if, for any choice of sufficiently generic edge lengths, it can be embedded in Rd in a finite number of distinct ways, modulo rigid transformations. Hereâ€¦ (More)