Sciweavers

2084 search results - page 361 / 417
» Proving Time Bounds for Randomized Distributed Algorithms
Sort
View
DAGM
2005
Springer
15 years 3 months ago
Cluster-Based Point Cloud Analysis for Rapid Scene Interpretation
A histogram-based method for the interpretation of three-dimensional (3D) point clouds is introduced, where point clouds represent the surface of a scene of multiple objects and ba...
Eric Wahl, Gerd Hirzinger
VR
2008
IEEE
175views Virtual Reality» more  VR 2008»
14 years 9 months ago
Managing Visual Clutter: A Generalized Technique for Label Segregation using Stereoscopic Disparity
We present a new technique for managing visual clutter caused by overlapping labels in complex information displays. This technique, "label layering", utilizes stereosco...
Stephen Peterson, Magnus Axholt, Stephen R. Ellis
ICDCS
2007
IEEE
15 years 4 months ago
A Weighted Moving Average-based Approach for Cleaning Sensor Data
Nowadays, wireless sensor networks have been widely used in many monitoring applications. Due to the low quality of sensors and random effects of the environment, however, it is ...
Yongzhen Zhuang, Lei Chen 0002, Xiaoyang Sean Wang...
AIIDE
2009
14 years 11 months ago
Demonstrating Automatic Content Generation in the Galactic Arms Race Video Game
In most modern video games, content (e.g. models, levels, weapons, etc.) shipped with the game is static and unchanging, or at best, randomized within a narrow set of parameters. ...
Erin J. Hastings, Ratan K. Guha, Kenneth O. Stanle...
TCC
2009
Springer
132views Cryptology» more  TCC 2009»
15 years 10 months ago
Authenticated Adversarial Routing
: The aim of this paper is to demonstrate the feasibility of authenticated throughput-ecient routing in an unreliable and dynamically changing synchronous network in which the majo...
Yair Amir, Paul Bunn, Rafail Ostrovsky