Sciweavers

103 search results - page 17 / 21
» Parallel geometric algorithms for multi-core computers
Sort
View
PODC
2009
ACM
14 years 7 months ago
Coloring unstructured wireless multi-hop networks
We present a randomized coloring algorithm for the unstructured radio network model, a model comprising autonomous nodes, asynchronous wake-up, no collision detection and an unkno...
Johannes Schneider, Roger Wattenhofer
CGF
2008
144views more  CGF 2008»
13 years 7 months ago
High Performance GPU-based Proximity Queries using Distance Fields
Proximity queries such as closest point computation and collision detection have many applications in computer graphics, including computer animation, physics-based modeling, augm...
T. Morvan, M. Reimers, E. Samset
ASPLOS
2009
ACM
14 years 7 months ago
Kendo: efficient deterministic multithreading in software
Although chip-multiprocessors have become the industry standard, developing parallel applications that target them remains a daunting task. Non-determinism, inherent in threaded a...
Marek Olszewski, Jason Ansel, Saman P. Amarasinghe
CG
2006
Springer
13 years 7 months ago
Supercover model, digital straight line recognition and curve reconstruction on the irregular isothetic grids
On the classical discrete grid, the analysis of digital straight lines (DSL for short) has been intensively studied for nearly half a century. In this article, we are interested i...
David Coeurjolly, Loutfi Zerarga
DCOSS
2007
Springer
13 years 11 months ago
Energy Efficient Intrusion Detection in Camera Sensor Networks
The problem we address in this paper is how to detect an intruder moving through a polygonal space that is equipped with a camera sensor network. We propose a probabilistic sensor ...
Primoz Skraba, Leonidas J. Guibas