Sciweavers

2188 search results - page 346 / 438
» Instance-Optimal Geometric Algorithms
Sort
View
CGF
2007
168views more  CGF 2007»
13 years 9 months ago
Global Illumination using Photon Ray Splatting
We present a novel framework for efficiently computing the indirect illumination in diffuse and moderately glossy scenes using density estimation techniques. Many existing global...
Robert Herzog, Vlastimil Havran, Shin-ichi Kinuwak...
IPSN
2007
Springer
14 years 4 months ago
Hierarchical spatial gossip for multi-resolution representations in sensor networks
In this paper we propose a lightweight algorithm for constructing multi-resolution data representations for sensor networks. We compute, at each sensor node u, O(log n) aggregates...
Rik Sarkar, Xianjin Zhu, Jie Gao
GECCO
2005
Springer
125views Optimization» more  GECCO 2005»
14 years 3 months ago
Schema disruption in tree-structured chromosomes
We study if and when the inequality dp(H) ≤ rel∆(H) holds for schemas H in chromosomes that are structured as trees. The disruption probability dp(H) is the probability that a...
William A. Greene
MMSEC
2004
ACM
205views Multimedia» more  MMSEC 2004»
14 years 3 months ago
Wavelet-based blind watermarking of 3D models
Watermarking of 3D meshes has received a limited attention due to the difficulties encountered in extending the algorithms developed for 1D (audio) and 2D (images and video) signa...
F. Uccheddu, Massimiliano Corsini, Mauro Barni
WADS
1993
Springer
163views Algorithms» more  WADS 1993»
14 years 2 months ago
Minimum Weight Euclidean Matching and Weighted Relative Neighborhood Graphs
The Minimum Weight Euclidean Matching (MWEM) problem is: given 2n point sites in the plane with Euclidean metric for interpoint distances, match the sites into n pairs so that the...
Andy Mirzaian