Sciweavers

5215 search results - page 974 / 1043
» Quantum clustering algorithms
Sort
View
MM
2003
ACM
133views Multimedia» more  MM 2003»
15 years 3 months ago
Real-time compression for dynamic 3D environments
The goal of tele-immersion has long been to enable people at remote locations to share a sense of presence. A tele-immersion system acquires the 3D representation of a collaborato...
Sang-Uok Kum, Ketan Mayer-Patel, Henry Fuchs
SIGGRAPH
2003
ACM
15 years 3 months ago
Interactive rendering of translucent deformable objects
Realistic rendering of materials such as milk, fruits, wax, marble, and so on, requires the simulation of subsurface scattering of light. This paper presents an algorithm for plau...
Tom Mertens, Jan Kautz, Philippe Bekaert, Hans-Pet...
ICDT
2001
ACM
147views Database» more  ICDT 2001»
15 years 2 months ago
Parallelizing the Data Cube
This paper presents a general methodology for the efficient parallelization of existing data cube construction algorithms. We describe two different partitioning strategies, one f...
Frank K. H. A. Dehne, Todd Eavis, Susanne E. Hambr...
KDD
1999
ACM
128views Data Mining» more  KDD 1999»
15 years 2 months ago
Towards Automated Synthesis of Data Mining Programs
Code synthesis is routinely used in industry to generate GUIs, form lling applications, and database support code and is even used with COBOL. In this paper we consider the questi...
Wray L. Buntine, Bernd Fischer 0002, Thomas Pressb...
ICDCS
2010
IEEE
15 years 1 months ago
P2P Streaming Capacity under Node Degree Bound
—Two of the fundamental problems in peer-to-peer (P2P) streaming are as follows: what is the maximum streaming rate that can be sustained for all receivers, and what peering algo...
Shao Liu, Minghua Chen, Sudipta Sengupta, Mung Chi...