100 search results - page 14 / 20 » A distributed incremental nearest neighbor algorithm |
ICPP
2006
IEEE
15 years 3 months ago
2006
IEEE
Space filling curves (SFCs) are widely used for parallel domain decomposition in scientific computing applications. The proximity preserving properties of SFCs are expected to k...
JGAA
2006
14 years 9 months ago
2006
The task of balancing dynamically generated work load occurs in a wide range of parallel and distributed applications. Diffusion based schemes, which belong to the class of neares...
AAAI
2010
14 years 11 months ago
2010
Gaussian Mixture Model (GMM) is one of the most popular data clustering methods which can be viewed as a linear combination of different Gaussian components. In GMM, each cluster ...
101
click to vote
TITS
2011
14 years 4 months ago
2011
—Due to modern pervasive wireless technologies and high-performance monitoring systems, spatio-temporal information plays an important role in areas such as intelligent transport...
108
click to vote
PPOPP
2010
ACM
15 years 7 months ago
2010
ACM
Effective data placement strategies can enhance the performance of data-intensive applications implemented on high end computing clusters. Such strategies can have a significant i...