Sciweavers

2799 search results - page 460 / 560
» computing 1998
Sort
View
DAGSTUHL
2010
15 years 3 months ago
Visual Simulation of Flow
We have adopted a numerical method from computational fluid dynamics, the Lattice Boltzmann Method (LBM), for real-time simulation and visualization of flow and amorphous phenomen...
Arie E. Kaufman, Ye Zhao
ICDE
1999
IEEE
123views Database» more  ICDE 1999»
16 years 3 months ago
Scalable Web Server Design for Distributed Data Management
Traditional techniques for a distributed web server design rely on manipulation of central resources, such as routers or DNS services, to distribute requests designated for a sing...
Scott M. Baker, Bongki Moon
CGF
2008
120views more  CGF 2008»
15 years 2 months ago
Generating Color Palettes using Intuitive Parameters
Color is widely used in data visualization to show data values. The proper selection of colors is critical to convey information correctly. In this paper, we present a technique f...
Martijn Wijffelaars, Roel Vliegen, Jarke J. van Wi...
135
Voted
SIGGRAPH
1998
ACM
15 years 5 months ago
The Office of the Future: A Unified Approach to Image-based Modeling and Spatially Immersive Displays
We introduce ideas, proposed technologies, and initial results for an office of the future that is based on a unified application of computer vision and computer graphics in a sys...
Ramesh Raskar, Greg Welch, Matt Cutts, Adam Lake, ...
SIAMCOMP
1998
114views more  SIAMCOMP 1998»
15 years 1 months ago
Maximum k-Chains in Planar Point Sets: Combinatorial Structure and Algorithms
A chain of a set P of n points in the plane is a chain of the dominance order on P. A k-chain is a subset C of P that can be covered by k chains. A k-chain C is a maximum k-chain ...
Stefan Felsner, Lorenz Wernisch