Sciweavers

1066 search results - page 88 / 214
» Computing Private Set Operations with Linear Complexities
Sort
View
STACS
1999
Springer
15 years 2 months ago
Lower Bounds for Dynamic Algebraic Problems
Abstract. We consider dynamic evaluation of algebraic functions (matrix multiplication, determinant, convolution, Fourier transform, etc.) in the model of Reif and Tate; i.e., if f...
Gudmund Skovbjerg Frandsen, Johan P. Hansen, Peter...
ISCAS
2005
IEEE
125views Hardware» more  ISCAS 2005»
15 years 3 months ago
A novel algorithm of spatial scalability for scrambled video
Although many researches have investigated transparent scrambling video techniques, an issue of which transcoding relates to downsizing scrambled video without unscrambling has ha...
YuanZhi Zou, Wen Gao
IJCV
2006
165views more  IJCV 2006»
14 years 9 months ago
A Riemannian Framework for Tensor Computing
Tensors are nowadays a common source of geometric information. In this paper, we propose to endow the tensor space with an affine-invariant Riemannian metric. We demonstrate that ...
Xavier Pennec, Pierre Fillard, Nicholas Ayache
GRAPHITE
2005
ACM
15 years 3 months ago
3D screen-space widgets for non-linear projection
Linear perspective is a good approximation to the format in which the human visual system conveys 3D scene information to the brain. Artists expressing 3D scenes, however, create ...
Patrick Coleman, Karan Singh, Leon Barrett, Nisha ...
FOCS
1994
IEEE
15 years 1 months ago
A Spectral Approach to Lower Bounds
We establish a nonlinear lower bound for halfplane range searching over a group. Specifically, we show that summing up the weights of n (weighted) points within n halfplanes requir...
Bernard Chazelle