Sciweavers

6365 search results - page 277 / 1273
» Fast Local Computation Algorithms
Sort
View
PPAM
2007
Springer
16 years 23 days ago
A Parallel Approximation Algorithm for the Weighted Maximum Matching Problem
Abstract. We consider the problem of computing a weighted edge matching in a large graph using a parallel algorithm. This problem has application in several areas of combinatorial ...
Fredrik Manne, Rob H. Bisseling
216
Voted
BCS
2008
15 years 8 months ago
Fast Estimation of Nonparametric Kernel Density Through PDDP, and its Application in Texture Synthesis
In this work, a new algorithm is proposed for fast estimation of nonparametric multivariate kernel density, based on principal direction divisive partitioning (PDDP) of the data s...
Arnab Sinha, Sumana Gupta
DCOSS
2009
Springer
15 years 11 months ago
Local Construction of Spanners in the 3-D Space
Abstract. In this paper we present local distributed algorithms for constructing spanners in wireless sensor networks modeled as unit ball graphs (shortly UBGs) and quasi-unit ball...
Iyad A. Kanj, Ge Xia, Fenghui Zhang
CAIP
2009
Springer
220views Image Analysis» more  CAIP 2009»
16 years 1 months ago
Cooperative Stereo Matching with Color-Based Adaptive Local Support
Color processing imposes a new constraint on stereo vision algorithms: The assumption of constant color on object surfaces used to align local correlation windows with object bound...
Roland Brockers
SNPD
2007
15 years 8 months ago
Localized Flooding Backbone Construction for Location Privacy in Sensor Networks
Source and destination location privacy is a challenging and important problem in sensor networks. Nevertheless, privacy preserving communication in sensor networks is still a vir...
Yingchang Xiang, Dechang Chen, Xiuzhen Cheng, Kai ...