4560 search results - page 5 / 912 » Finding Data in the Neighborhood |
JGTOOLS
2008
14 years 9 months ago
2008
This is an algorithm for finding neighbors for point objects that can freely move and have no predefined position. The query sphere consists of a center location and a given radiu...
86
Voted
UAI
2008
14 years 11 months ago
2008
Chordal graphs can be used to encode dependency models that are representable by both directed acyclic and undirected graphs. This paper discusses a very simple and efficient algo...
COMPGEOM
2003
ACM
15 years 2 months ago
2003
ACM
In this paper we describe and analyze a method based on local least square fitting for estimating the normals at all sample points of a point cloud data (PCD) set, in the presenc...
77
Voted
EWSN
2007
Springer
15 years 9 months ago
2007
Springer
Many applications in wireless sensor networks rely on data from neighboring nodes. However, the effort for developing efficient solutions for sharing data in the neighborhood is of...
94
Voted
EVOW
2009
Springer
15 years 2 months ago
2009
Springer
This paper deals with the generation of balanced incomplete block designs (BIBD), a hard constrained combinatorial problem with multiple applications. This problem is here formulat...