Results 31 to 40 of about 483,846 (289)
A randomized approximate nearest neighbors algorithm [PDF]
We present a randomized algorithm for the approximate nearest neighbor problem in d -dimensional Euclidean space. Given N points { x j } in , the ...
Peter Wilcox, Jones +2 more
openaire +2 more sources
A Hybrid Spatial Indexing Structure of Massive Point Cloud Based on Octree and 3D R*-Tree
The spatial index structure is one of the most important research topics for organizing and managing massive 3D Point Cloud. As a point in Point Cloud consists of Cartesian coordinates (x,y,z), the common method to explore geometric information and ...
Wei Wang +5 more
doaj +1 more source
Next-nearest-neighbor Tight-binding Model of Plasmons in Graphene
In this paper we investigate the influence of the next-nearest-neighbor coupling of tight-binding model of graphene on the spectrum of plasmon excitations.
Kadirko, V., Kogan, E., Ziegler, K.
core +1 more source
Nearest Neighbor Search in the Metric Space of a Complex Network for Community Detection
The objective of this article is to bridge the gap between two important research directions: (1) nearest neighbor search, which is a fundamental computational tool for large data analysis; and (2) complex network analysis, which deals with large real ...
Suman Saha, Satya P. Ghrera
doaj +1 more source
Comparison of five distance sampling methods for estimating quantitative characteristics of Zagros Forests [PDF]
Distance sampling methods are extensively used for forests management of Zagros region of Iran. In the present study, estimation of quantitative characteristics of sampling methods, including individual, nearest neighbor, second nearest neighbor ...
Yusof Askari +3 more
doaj +1 more source
Collapse transition of a square-lattice polymer with next nearest-neighbor interaction
We study the collapse transition of a polymer on a square lattice with both nearest-neighbor and next nearest-neighbor interactions, by calculating the exact partition function zeros up to chain length 36.
Flory P. J. +3 more
core +1 more source
Hamiltonian decomposition for bulk and surface states
We demonstrate that a tight-binding Hamiltonian with nearest- and next-nearest-neighbor hopping integrals can be decomposed into bulk and boundary parts in a general lattice system. The Hamiltonian decomposition reveals that next nearest-neighbor hopping
C. Kittel +4 more
core +1 more source
Enhancing SR-Tree for Nearest Neighbor Search
Nearest neighbor search, also known as k-nearest neighbors (kNN), has become one of the essential backbones in machine learning and data mining tasks, particularly in multidimensional dynamic and evolving data environments. While dynamic index structures
Kayumov Abduaziz +2 more
doaj +1 more source
Topological phase transitions driven by next-nearest-neighbor hopping in two-dimensional lattices
For two-dimensional lattices in a tight-binding description, the intrinsic spin-orbit coupling, acting as a complex next-nearest-neighbor hopping, opens gaps that exhibit the quantum spin Hall effect.
Beugeling, W. +2 more
core +1 more source
An $S=1/2$ triangular-lattice Heisenberg antiferromagnet with next-nearest-neighbor interactions is investigated under a magnetic field by the numerical-diagonalization method.
Nakano, Hiroki, Sakai, Toru
core +1 more source

