Sciweavers

550 search results - page 12 / 110
» Inherently Parallel Geometric Computations
Sort
View
ICDCS
2008
IEEE
14 years 3 months ago
Distributed Connected Dominating Set Construction in Geometric k-Disk Graphs
In this paper, we study the problem of minimum connected dominating set in geometric k-disk graphs. This research is motivated by the problem of virtual backbone construction in w...
Kai Xing, Wei Cheng, E. K. Park, Shmuel Rotenstrei...
EUROPAR
2009
Springer
13 years 6 months ago
Parallel Variable-Length Encoding on GPGPUs
Variable-Length Encoding (VLE) is a process of reducing input data size by replacing fixed-length data words with codewords of shorter length. As VLE is one of the main building bl...
Ana Balevic
IPPS
1998
IEEE
14 years 25 days ago
Capturing the Connectivity of High-Dimensional Geometric Spaces by Parallelizable Random Sampling Techniques
Abstract. Finding paths in high-dimensional gemetric spaces is a provably hard problem. Recently, a general randomized planning scheme has emerged as an e ective approach to solve ...
David Hsu, Lydia E. Kavraki, Jean-Claude Latombe, ...
CVPR
2006
IEEE
14 years 10 months ago
Surface Geometric Constraints for Stereo in Belief Propagation
Belief propagation has been shown to be a powerful inference mechanism for stereo correspondence. However the classical formulation of belief propagation implicitly imposes the fr...
Gang Li, Steven W. Zucker
CONCUR
2005
Springer
14 years 2 months ago
A Practical Application of Geometric Semantics to Static Analysis of Concurrent Programs
Abstract. In this paper we show how to compress efficiently the statespace of a concurrent system (here applied to a simple shared memory model, but this is no way limited to that ...
Eric Goubault, Emmanuel Haucourt