Sciweavers

2029 search results - page 219 / 406
» informs 2002
Sort
View
CCR
2002
96views more  CCR 2002»
15 years 5 months ago
Adaptive bandwidth control for efficient aggregate QoS provisioning
Abstract-This paper proposes an adaptive bandwidth control algorithm that efficiently provides aggregate loss guarantee to resolve the problem of inefficient bandwidth allocation d...
Peerapon Siripongwutikorn, Sujata Banerjee, David ...
CGF
2002
116views more  CGF 2002»
15 years 5 months ago
Deferred, Self-Organizing BSP Trees
BSP trees and KD trees are fundamental data structures for collision detection in walkthrough environments. A basic issue in the construction of these hierarchical data structures...
Sigal Ar, Gil Montag, Ayellet Tal
CGF
2002
123views more  CGF 2002»
15 years 5 months ago
A Frequency-Domain Approach to Watermarking 3D Shapes
This paper presents a robust watermarking algorithm with informed detection for 3D polygonal meshes. The algorithm is based on our previous algorithm [22] that employs mesh-spectr...
Ryutarou Ohbuchi, Akio Mukaiyama, Shigeo Takahashi
CGF
2002
155views more  CGF 2002»
15 years 5 months ago
Improved Scene Reconstruction from Range Images
The modeling of real scenes is a complex and challenging task for which the use of laser rangefinders is one of the most promising approaches. Unfortunately, in many situations, i...
Jianning Wang, Manuel M. Oliveira
CJ
2002
67views more  CJ 2002»
15 years 5 months ago
Using Bloom Filters to Speed-up Name Lookup in Distributed Systems
Bloom filters make use of a "probabilistic" hash-coding method to reduce the amount of space required to store a hash set. A Bloom filter offers a trade-off between its ...
Mark C. Little, Santosh K. Shrivastava, Neil A. Sp...