Sciweavers

55 search results - page 11 / 11
» Deconstructing approximate offsets
Sort
View
STOC
2003
ACM
188views Algorithms» more  STOC 2003»
14 years 5 months ago
Almost random graphs with simple hash functions
We describe a simple randomized construction for generating pairs of hash functions h1, h2 from a universe U to ranges V = [m] = {0, 1, . . . , m - 1} and W = [m] so that for ever...
Martin Dietzfelbinger, Philipp Woelfel
HPDC
2006
IEEE
13 years 11 months ago
Adaptive I/O Scheduling for Distributed Multi-applications Environments
The aIOLi project aims at optimizing the I/O accesses within the cluster by providing a simple POSIX API, thus avoiding the constraints to use a dedicated parallel I/O library. Th...
Adrien Lebre, Yves Denneulin, Guillaume Huard, Prz...
SMA
2008
ACM
182views Solid Modeling» more  SMA 2008»
13 years 5 months ago
Voronoi diagram computations for planar NURBS curves
We present robust and efficient algorithms for computing Voronoi diagrams of planar freeform curves. Boundaries of the Voronoi diagram consist of portions of the bisector curves b...
Joon-Kyung Seong, Elaine Cohen, Gershon Elber
TOH
2008
98views more  TOH 2008»
13 years 5 months ago
Six-DoF Haptic Rendering of Contact Between Geometrically Complex Reduced Deformable Models
Real-time evaluation of distributed contact forces between rigid or deformable 3D objects is a key ingredient of 6-DoF force-feedback rendering. Unfortunately, at very high tempora...
Jernej Barbic, Doug L. James
VC
2008
162views more  VC 2008»
13 years 5 months ago
Realization of Seurat's pointillism via non-photorealistic rendering
Photorealistic rendering is one of the oldest and most important research areas in computer graphics. More recently, the concept of nonphotorealistic rendering has been proposed as...
Chuan-Kai Yang, Hui-Lin Yang