Sciweavers

3690 search results - page 424 / 738
» Computation with classical sequents
Sort
View
FOCS
2000
IEEE
15 years 11 months ago
Fast parallel circuits for the quantum Fourier transform
We give new bounds on the circuit complexity of the quantum Fourier transform (QFT). We give an upper bound of Ç´ÐÓ Ò · ÐÓ ÐÓ ´½ µµ on the circuit depth for computin...
Richard Cleve, John Watrous
VVS
2000
IEEE
196views Visualization» more  VVS 2000»
15 years 11 months ago
Accelerating volume rendering with quantized voxels
We present here a new algorithm for accelerating volume rendering with an orthographic projection. Because volume rendering handles huge data sets, a reduction in the computationa...
Benjamin Mora, Jean-Pierre Jessel, René Cau...
CHI
2010
ACM
15 years 11 months ago
Share: a programming environment for loosely bound cooperation
We introduce a programming environment entitled Share that is designed to encourage loosely bound cooperation between individuals within communities of practice through the sharin...
Yannick Assogba, Judith S. Donath
CVPR
1997
IEEE
15 years 11 months ago
Area and Length Minimizing Flows for Shape Segmentation
— A number of active contour models have been proposed that unify the curve evolution framework with classical energy minimization techniques for segmentation, such as snakes. Th...
Kaleem Siddiqi, Steven W. Zucker, Yves Béru...
178
Voted
PODC
1997
ACM
15 years 11 months ago
The Load and Availability of Byzantine Quorum Systems
Replicated services accessed via quorums enable each access to be performed at only a subset (quorum) of the servers and achieve consistency across accesses by requiring any two qu...
Dahlia Malkhi, Michael K. Reiter, Avishai Wool