Sciweavers

14642 search results - page 2824 / 2929
» It's Time for a Change
Sort
View
SI3D
1999
ACM
15 years 10 months ago
GAPS: general and automatic polygonal simplification
We present a new approach for simplifying polygonal objects. Our method is general in that it works on models that contain both non-manifold geometry and surface attributes. It is...
Carl Erikson, Dinesh Manocha
FOCS
1999
IEEE
15 years 10 months ago
Near-Optimal Conversion of Hardness into Pseudo-Randomness
Various efforts ([?, ?, ?]) have been made in recent years to derandomize probabilistic algorithms using the complexity theoretic assumption that there exists a problem in E = dti...
Russell Impagliazzo, Ronen Shaltiel, Avi Wigderson
STOC
1999
ACM
101views Algorithms» more  STOC 1999»
15 years 10 months ago
Short Proofs are Narrow - Resolution Made Simple
The width of a Resolution proof is defined to be the maximal number of literals in any clause of the proof. In this paper, we relate proof width to proof length (ϭsize), in both g...
Eli Ben-Sasson, Avi Wigderson
ICRA
1999
IEEE
151views Robotics» more  ICRA 1999»
15 years 10 months ago
Interaction with a Realtime Dynamic Environment Simulation Using a Magnetic Levitation Haptic Interface Device
A high performance six degree-of-freedom magnetic levitation haptic interface device has been integrated with a physically-based dynamic rigid-body simulation to enable realistic ...
Peter J. Berkelman, Ralph L. Hollis, David Baraff
CIKM
1999
Springer
15 years 10 months ago
Requirement-Based Data Cube Schema Design
On-line analytical processing (OLAP) requires e cient processing of complex decision support queries over very large databases. It is well accepted that pre-computed data cubes ca...
David Wai-Lok Cheung, Bo Zhou, Ben Kao, Hongjun Lu...
« Prev « First page 2824 / 2929 Last » Next »